2009 | ||
---|---|---|
40 | EE | Miklós Erdélyi, András A. Benczúr, Julien Masanés, Dávid Siklósi: Web spam filtering in internet archives. AIRWeb 2009: 17-20 |
39 | EE | István Bíró, Dávid Siklósi, Jácint Szabó, András A. Benczúr: Linked latent Dirichlet allocation in web spam filtering. AIRWeb 2009: 37-40 |
38 | EE | András A. Benczúr, Miklós Erdélyi, Julien Masanés, Dávid Siklósi: Web spam challenge proposal for filtering in archives. AIRWeb 2009: 61-62 |
2008 | ||
37 | EE | István Bíró, Jácint Szabó, András A. Benczúr: Latent dirichlet allocation in web spam filtering. AIRWeb 2008: 29-32 |
36 | EE | István Bíró, András A. Benczúr, Jácint Szabó, Ana Gabriela Maguitman: A Comparative Analysis of Latent Variable Models for Web Page Classification. LA-WEB 2008: 23-28 |
35 | EE | László A. Végh, András A. Benczúr: Primal-dual approach for directed vertex connectivity augmentation and generalizations. ACM Transactions on Algorithms 4(2): (2008) |
2007 | ||
34 | EE | András A. Benczúr, István Bíró, Károly Csalogány, Tamás Sarlós: Web Spam Detection via Commercial Intent Analysis. AIRWeb 2007 |
33 | EE | Thomas Deselaers, Allan Hanbury, Ville Viitaniemi, András A. Benczúr, Mátyás Brendel, Bálint Daróczy, Hugo Jair Escalante Balderas, Theo Gevers, Carlos Arturo Hernández Gracidas, Steven C. H. Hoi, Jorma Laaksonen, Mingjing Li, Heidy Marisol Marín Castro, Hermann Ney, Xiaoguang Rui, Nicu Sebe, Julian Stöttinger, Lei Wu: Overview of the ImageCLEF 2007 Object Retrieval Task. CLEF 2007: 445-471 |
32 | EE | András A. Benczúr, István Bíró, Mátyás Brendel, Károly Csalogány, Bálint Daróczy, Dávid Siklósi: Multimodal Retrieval by Text-Segment Biclustering. CLEF 2007: 518-521 |
31 | EE | Péter Schönhofen, András A. Benczúr, István Bíró, Károly Csalogány: Cross-Language Retrieval with Wikipedia. CLEF 2007: 72-79 |
30 | EE | Miklós Kurucz, András A. Benczúr, Károly Csalogány, László Lukács: Spectral Clustering in Social Networks. WebKDD/SNA-KDD 2007: 1-20 |
29 | EE | Miklós Kurucz, András A. Benczúr, Tamás Kiss, István Nagy, Adrienn Szabó, Balázs Torma: KDD Cup 2007 task 1 winner report. SIGKDD Explorations 9(2): 53-56 (2007) |
2006 | ||
28 | EE | András A. Benczúr, Zsolt Hernáth, Zoltán Porkoláb: LORD: Lay-Out Relationship and Domain Definition Language. ADBIS Research Communications 2006 |
27 | EE | András A. Benczúr, Károly Csalogány, Tamás Sarlós: Link-Based Similarity Search to Fight Web Spam. AIRWeb 2006: 9-16 |
26 | EE | Balázs Rácz, Csaba István Sidló, András Lukács, András A. Benczúr: Two-Phase Data Warehouse Optimized for Data Mining. BIRTE 2006: 63-76 |
25 | EE | Péter Schönhofen, András A. Benczúr: Exploiting Extremely Rare Features in Text Categorization. ECML 2006: 759-766 |
24 | EE | Tamás Sarlós, András A. Benczúr, Károly Csalogány, Dániel Fogaras, Balázs Rácz: To randomize or not to randomize: space optimal summaries for hyperlink analysis. WWW 2006: 297-306 |
23 | EE | András A. Benczúr, István Bíró, Károly Csalogány, Máté Uher: Detecting nepotistic links by language model disagreement. WWW 2006: 939-940 |
2005 | ||
22 | EE | András A. Benczúr, Zsolt Hernáth, Zoltán Porkoláb: Autonomous Applications - Towards a Better Data Integration Model. ADBIS Research Communications 2005 |
21 | EE | András A. Benczúr, Károly Csalogány, Tamás Sarlós, Máté Uher: SpamRank -- Fully Automatic Link Spam Detection. AIRWeb 2005: 25-38 |
20 | EE | László A. Végh, András A. Benczúr: Primal-dual approach for directed vertex connectivity augmentation and generalizations. SODA 2005: 186-194 |
19 | EE | András A. Benczúr, Károly Csalogány, Tamás Sarlós: On the feasibility of low-rank approximation for personalized PageRank. WWW (Special interest tracks and posters) 2005: 972-973 |
2004 | ||
18 | Georg Gottlob, András A. Benczúr, János Demetrovics: Advances in Databases and Information Systems, 8th East European Conference, ADBIS 2004, Budapest, Hungary, September 22-25, 2004, Proceesing Springer 2004 | |
17 | EE | András A. Benczúr, Balázs Kósa: Static Analysis of Structural Recursion in Semistructured Databases and Its Consequences. ADBIS 2004: 189-203 |
2003 | ||
16 | EE | András A. Benczúr, Uwe Glässer, Tamás Lukovszki: Formal Description of a Distributed Location Service for Mobile Ad Hoc Networks. Abstract State Machines 2003: 204-217 |
15 | András A. Benczúr, Antal Buza: The Effect of Non-execution and Part Task Result Integration in Distributed Data-intensive Computing Systems. SPLST 2003: 2-13 | |
14 | EE | András A. Benczúr, Tamás Sarlós, Máté Uher, Eszter Windhager: Searching a Small National Domain - Preliminary Report. WWW (Posters) 2003 |
13 | EE | András A. Benczúr: Pushdown-reduce: an algorithm for connectivity augmentation and poset covering problems. Discrete Applied Mathematics 129(2-3): 233-262 (2003) |
2002 | ||
12 | EE | András A. Benczúr, David R. Karger: Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs CoRR cs.DS/0207078: (2002) |
2000 | ||
11 | András A. Benczúr, Ottilia Fülöp: Fast Algorithms for Even/Odd Minimum Cuts and Generalizations. ESA 2000: 88-99 | |
10 | András A. Benczúr, David R. Karger: Augmenting Undirected Edge Connectivity in Õ(n2) Time. J. Algorithms 37(1): 2-36 (2000) | |
1999 | ||
9 | EE | András A. Benczúr, Jörg Förster, Zoltán Király: Dilworth's Theorem and Its Application for Path Systems of a Cycle - Implementation and Analysis. ESA 1999: 498-509 |
1998 | ||
8 | András A. Benczúr, David R. Karger: Augmenting Undirected Edge Connectivity in Õ(n²) Time. SODA 1998: 500-509 | |
1996 | ||
7 | EE | András A. Benczúr, David R. Karger: Approximating s-t Minimum Cuts in Õ(n2) Time. STOC 1996: 47-55 |
1995 | ||
6 | András A. Benczúr: A Representation of Cuts within 6/5 Times the Edge Connectivity with Applications. FOCS 1995: 92-102 | |
5 | András A. Benczúr: Counterexamples for Directed and Node Capacitated Cut-Trees. SIAM J. Comput. 24(3): 505-510 (1995) | |
1987 | ||
4 | EE | András A. Benczúr: Information Measurement in Relational Databases. MFDBS 1987: 1-9 |
1979 | ||
3 | András A. Benczúr, A. Krámli: An Example for an Adaptive Control Method Providing Data Based Integrity. Performance 1979: 263-276 | |
1977 | ||
2 | András A. Benczúr, A. Krámli: A note on data base integritz. Acta Cybern. 3: 181-185 (1977) | |
1 | András A. Benczúr, A. Krámli, J. Pergel: On the Bayesian approach to optimal performance of page storage hierarchies. Acta Cybern. 3: 79-89 (1977) |