Informatics Laboratory
Publications
[
order by time]
[
order by categories ]
[
order by authors]
Algebra
- Root filtration spaces from Lie algebras and abstract root groups
algebraic combinatorics
- Some extensions of Alon's Nullstellensatz
- On the Grasshopper problem with signed jumps
- Remarks to Arsovski's proof of Snevily's conjecture
Authors: Harcos, G.; Károlyi, Gy.; Kós, GézaDate: 2011.
computational complexity
- Locally 2-dimensional Sperner problems complete for the polynomial parity argument classes
Authors: Friedl, K.; Ivanyos, Gábor; Santha, M.; Verhoeven, YFDate: 2006.
continous optimization
- On optimal completions of incomplete pairwise comparison matrices
Geometry
- Root filtration spaces from Lie algebras and abstract root groups
symbolic computation
- Approximate radical of ideals with clusters of roots
Authors: Janovitz-Freireich, I.; Rónyai, Lajos; Szántó, Á.Editor: Dumas, JGDate: 2006.
Publication without a category
- SZTAKI @ ImageCLEF 2012 Photo Annotation
- Egy általános célú morfológiai annotáció
- Rekurzívak-e a természetes nyelvek?
- Probabilistic Grammars and Languages
- Ferenc Kárteszi (1907--1989): a short biography
- The algebra of lexical semantics
- Eliminating ditransitives
Authors: Kornai, AndrásEditor: Egg, M.; de Groote, P.; Nederhof, M-J; Richter, F.Date: 2011.
- A 4lang fogalmi szótár
- Geographically organized small communities and the hardness of clustering social networks
- Digital video event detector framework for surveillance applications
- Egy érdekes és egyszerű transzformációval származtatott nem-desarguesi affin sík
- The treatment of ordinary quantification in English proper
- Affinely regular polygons in an affine plane
- Approximate Radical for Clusters: A Global Approach Using Gaussian Elimination or SVD
Authors: Janovitz-Freireich, Itnuit; Szántó, Ágnes; Rónyai, LajosDate: 2007.
- Approximate radical of ideals with clusters of roots
Authors: Janovitz-Freireich, Itnuit; Rónyai, Lajos; Szántó, ÁgnesDate: 2007.
- Moment matrices, trace matrices and the radical of ideals
Authors: Janovitz-Freireich, Itnuit; Mourrain, Bernard; Rónyai, Lajos; Szántó, ÁgnesEditor: Sendra, J. R.; Gonzales-Vega, L.Date: 2008.
- Computing approximate radicals using Bezoutians
Authors: Janovitz-Freireich, Itnuit; Mourrain, Bernard; Rónyai, Lajos; Szántó, ÁgnesDate: 2007.
- The Mathematics of Language.: Proceedings of the 12th Biennial Meeting on Mathematics in Language (MOL12)
Authors: Kanazawa, Makoto; Kornai, András; Kracht, Marcus; Seki, HiroyukiDate: 2011. 09.
- Relative Newton numbers of regular polygons with equal side lengths
- Prediction from randomly right censored data
Authors: Kohler, M.; Máté, K.; Pintér, M.Date: 2002.
- Degree-based graph construction
Authors: Kim, P.; Toroczkai, Z.; Erdős, P.; Miklós, István; Székely, L.Date: 2009.
- Protecting regular polygons
Authors: Kemnitz, A.; Szabó, L.; Ujváry-Menyhárt, Z.Date: 2000.
- Methods for large scale SVD with missing values
- Who rated what: a combination of SVD, correlation and frequent sequence mining
- Generating random elements of abelian groups
- Reconstruction of matrices from submatrices
Authors: Kós, Géza; Ligeti, Péter; Sziklai, PéterDate: 2009.
- Simultaneous extensions of Turkevich's inequality and the weighted AM-GM inequality
Authors: Kós, Géza; Lee, Hojoo; Vanderdriesche, PeterDate: 2012.
- Two Turán type inequalities
- Finite contractions of graphs with polynomial growth
- SimulFold: simultaneously inferring RNA structures including pseudoknots, alignments, and trees using a Bayesian MCMC framework
- Introduction to Algorithms in Bioinformatics
- Bioinformatics
- Algorithms of Bioinformatics
- Tetraéderek közös belső ponttal, avagy egy Kürschák-feladat utóélete
- Lehet egy közelítéssel kevesebb?
- Large-scale principal component analysis on LiveJournal friends network
- KDD cup 2007 task 1 winner report
- An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups
- Telephone call network data mining: a survey with experiments
- KDD Cup 2009 @ Budapest: feature partitioning and boosting
- Komplex függvénytan
Authors: Kós, GézaEditor: Gerőcs, László; Vancsó, ÖdönDate: 2010.
- Periodic decomposition of integer valued functions
Authors: Károlyi, Gyula; Keleti, Tamás; Kós, Géza; Ruzsa, I. Z.Date: 2008.
- Kapcsolatok és távolságok: a hazai vezetékes hívás-szokások elemzése
- Spectral clustering in telephone call graphs
- An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups
- On embedding large (k,n)-arcs and partial unitals
- Cross-Lingual Data Quality for Knowledge Base Acceleration across Wikipedia Editions
- Hannan consistency in on-line learning in case of unbounded losses under partial monitoring

- On maximal partial spreads
- Newton numbers for overlapping circular discs
Authors: Harborth, H.; Koch, M.; Szabó, L.Date: 2001.
- Regular sphere packings
Authors: Harborth, H.; Szabó, L.; Ujváry-Menyhárt, Z.Date: 2002.
- Gröbner bases for complete uniform families
- Gröbner bases for permutations and oriented trees
- Small point sets of PG(n,p^{3h}) intersecting each line in 1 mod p^h points
Authors: Harrach, N. V.; Metsch, K.; Szőnyi, Tamás; Weiner, Zs.Date: 2010.
- Directions in AG(2,p^2)
- The on-line shortest path problem under partial monitoring
- Limited-delay coding of individual sequences with piecewise different behavior
- Efficient algorithms and minimax bounds for zero-delay lossy source coding
- Efficient adaptive algorithms and minimax bounds for zero-delay lossy source coding
- Do optimal entropy-constrained quantizers have a finite or infinite number of codewords?
- Tracking the best of many experts
- Tracking the best quantizer
- Efficient multi-start strategies for local search algorithms
- Convergence rates in higher order Markov modeling of block-Markov sources
- A 'follow the perturbed leader'-type algorithm for zero-delay quantization of individual sequences
- Standard monomials for q-uniform families and a conjecture of Babai and Frankl
- Standard monomials for partitions
- On the distance between non-isomorphic groups
Authors: Ivanyos, Gábor; Le Gall, Francois; Yoshida, YuichiDate: 2012.
- Schemes for deterministic polynomial factoring
Authors: Ivanyos, Gábor; Karpinski, Marek; Saxena, NitinEditor: Johnson, J.; Park, H.; Kaltofen, E.Date: 2009. 07. 28.
- Deterministic polynomial time algorithms for matrix completion problems
- Trading GRH for algebra: algorithms for factoring polynomials and related structures
- Constructions for quantum computing with symmetrized gates
- Algebra
- An efficient quantum algorithm for the hidden subgroup problem in extraspecial groups
Authors: Ivanyos, Gábor; Sanselme, Luc; Santha, MiklosEditor: Weil, W. T.Date: 2007.
- Splitting full matrix algebras over algebraic number fields
- Algebra
- On solving systems of random linear disequations
- Finding hidden Borel subgroups of the general linear group
- Fast randomized algorithms for the structure of matrix algebras over finite fields
- Deciding finiteness for matrix semigroups over function fields over finite fields
- IMO2007 Shortlisted Problems
Authors: Huy Khoai, Ha; Ilya, Bogdanov; Nam Dung, Tran; Tuan Hoa, Le; Kós, GézaDate: 2007.
- Hibajavító kódok
- Treating the exceptional cases of the MeatAxe
- Efficient quantum algorithms for some instances of the non-abelian hidden subgroup problem
- Deciding universality of quantum gates
- Quantum computing on lattices using global two-qubit gates
- Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem
- RNA Structure Prediction
- Journal of Computational Biology
- Web Spam Hunting @ Budapest
- Shaping SQL-based frequent pattern mining algorithms
- Infrastructures and bound for distributed entity resolution
- Generic entity resolution in relational databases
- Content-based trust and bias classification via biclustering
- Big Web Analytics: Toward a Virtual Web Observatory
- Reticular alignment: a progressive corner-cutting method for multiple sequence alignment
- Edit wars in Wikipedia
Authors: Sumi, Róbert; Yasseri, Taha; Rung, András; Kornai, András; Kertész, JánosDate: 2011. 10.
- Characterization and prediction of Wikipedia edit wars
Authors: Sumi, Róbert; Rung, András; Kornai, András; Kertész, JánosDate: 2011. 06.
- Entity resolution with heavy indexing
- Shaping SQL-based frequent pattern mining algorithms
- Feature selection based on word-sentence relation
- Primitive flag-transitive generalized hexagons and octagons
- The derived series of a finite p-group
- Small derived quotients in finite p-groups
- Sentence-based document size reduction
- Identifying document topics using the wikipedia category network
- Performing cross-language retrieval with wikipedia
- Cross-language retrieval with wikipedia
- Exploiting extremely rare features in text categorization
- Kombinatorikus geometria és geometriai algoritmusok. (Polygon könyvtár)
- Maximal facet-to-facet snakes of unit cubes
Authors: Szabó, L.; Ujvári-Menyhárt, Z.Date: 2001.
- A practical approach to language complexity: a wikipedia case study
- Longitudinal Analytics on Web Archive Data: It's About Time!
Authors: Weikum, Gerhard; Ntarmos, Nikos; Spaniol, Marc; Triantafillou, Peter; Benczúr, András; Scott, Kirkpatrick; Rigaux, Philippe; Williamson, MarkDate: 2011.
- Longitudinal analytics on web archive data: it's about time!
Authors: Weikum, G.; Ntarmos, N.; Spaniol, M.; Triantafillou, P.; Benczúr, András; Kirkpatrick, S.; Rigaux, P.; Williamson, M.Date: 2011.
- Primal-dual approach for directed vertex connectivity augmentation and generalizations
- Dynamics of conflicts in Wikipedia
Authors: Yasseri, T.; Sumi, R.; Rung, A.; Kornai, András; Kertész, J.Date: 2012.
- IMO2010 Shortlisted Problems

Authors: Yerzhan, Baissalov; Ilya, Bogdanov; Kós, Géza; Nairi, Sedrakyan; Damir, Yeliussizov; Kuat, YessenovDate: 2010. 07. 15.
- IMO2011 Shortlisted Problems
Authors: de Smit, B.; Bogdanov, I.; Bosman, J.; Brouwer, A.; Dalla Torre, G.; Kós, Géza; Lenstra, H.; Leytem, Ch.; van Luijk, R.; Reiher, Ch.; Specht, E.; Sterk, E.; Taelman, L.Date: 2011. 07. 10.
- Rapid creation of large-scale corpora and frequency dictionaries
Authors: Zséder, Attila; Recski, Gábor; Varga, Dániel; Kornai, AndrásEditor: Calzolari, Nicoletta; Choukri, Khalid; Declerck, Thierry; Doğan, Mehmet Uğur; Maegaard, Bente; Mariani, Joseph; Odijk, Jan; Piperidis, SteliosDate: 2012. 05.
- Finite-state methods and models in natural language processing
Authors: Yli-Jyrä, Anssi; Kornai, András; Sakarovitch, JacquesDate: 2011. 04.
- Primal-dual approach for directed vertex connectivity augmentation and generalizations
- IMO2008 Shortlisted Problems
Authors: Vicente Munoz, Velazquez; Juan Manuel Conde, Calero; Kós, Géza; Marcin, Kuczma; Ignasi Mundet, Rivera; Svetoslav, SavchevDate: 2008.
- Proof of a conjecture of Metsch
- On the spectrum of minimal blocking sets
- On large minimal blocking sets in PG(2,q)
Authors: Szőnyi, Tamás; Cossidente, A.; Gács, A.; Mengyán, Cs; Alessandro, S.; Weiner, ZsDate: 2005.
- Clouds of planar convex bodies
Authors: Szabó, L.; Ujváry-Menyhárt, Z.Date: 2002.
- Failure localization for shared risk link groups in all-optical mesh networks using monitoring trails
Authors: Tapolcai, János; Ho, Pin-Han; Rónyai, Lajos; Babarczi, Péter; Wu, BinDate: 2011.
- Optimal solutions for single fault localization in two dimensional lattice networks
Authors: Tapolcai, János; Rónyai, Lajos; Ho, Pin-HanDate: 2010. 05. 06.
- Impact of non-Poissonian activity patterns on spreading processes
Authors: Vazquez, A.; Rácz, B.; Lukács, András; Barabási, A. -L.Date: 2007.
- Impact of non-Poisson activity patterns on spreading processes
- A novel approach for failure localization in all-optical mesh networks
Authors: Tapolcai, János; Wu, Bin; Ho, Pin-Han; Rónyai, LajosDate: 2011.
- A computer-based approach to the classification of nilpotent Lie algebras
- BigFoot: Bayesian Alignment and Phylogenetic Footprinting with MCMC BMC
Authors: Satija, R.; Novák, Á.; Miklós, István; Lyngsoe, R.; Hein, J.Date: 2009.
- Standard monomials of some symmetric sets
- Sequential prediction of binary sequence with side information only
- StatAlign: an extendable software package for joint Bayesian estimation of alignments and evolutionary trees
Authors: Novák, Ádám; Miklós, István; Lyngso, Rune; Hein, JotunDate: 2008.
- Automatikus korpuszépítés tulajdonnév-felismerés céljára
- On the Hilbert function of complementary set families
- On the rate of convergence of error estimates for the partitioning classification rule
- Főnévi csoportok azonosítása szabályalapú és hibrid módszerekkel
- Design of sample adaptive product quantizers for noisy channels
- Three types of inclusions of innately transitive permutation groups into wreath products in product action
- Automatically generated NE tagged corpora for English and Hungarian
- SZTAKI @ ResPubliQA 2010
- Stochastic Models of Sequence Evolution including Insertion-Deletion events Statistical Methods in Medical Research
Authors: Miklós, István; Novák, Á.; Satija, R.; Lyngsoe, R.; Hein, J.Date: 2008.
- The Metropolized Partial Importance Sampling MCMC mixes slowly on minimum reversal rearrangement paths
- Efficient sampling of parsimonious inversion histories with application to genome rearrangement in Yersinia
- A note on the existence of optimal entropy-constrained vector quantizers
- Stochastic models of sequence evolution including insertion-deletion events
Authors: Miklós, István; Novák, Á.; Satija, R.; Lyngsoe, R.; Hein, J.Date: 2009.
- How reliably can we predict the reliability of protein structure predictions?
Authors: Miklós, István; Novák, Ádám; Dombai, Balázs; Hein, JotunDate: 2008.
- BUDAPESTACAD at TAC 2010
- Flexible and Efficient Distributed Resolution of Large Entities
- Bayesian sampling of genomic rearrangement scenarios via double cut and join
- A sekély mondattani elemzés további lépései
- NP alignment in bilingual corpora
- The work of György Elekes on some combinatorial properties of polynomials
- Elekes György polinomokkal kapcsolatos kombinatorikai eredményeiről
- Efficient algorithms
- On the number of zero-patterns of a sequence of polynomials
- Multivalued generalizations of the Frankl-Pach Theorem
- Splitting full matrix algebras over algebraic number fields
- To randomize or not to randomize: space optimal summaries for hyperlink analysis
- Improved approximation algorithms for large matrices via random projections
- Some combinatorial applications of Gröbner bases
Authors: Rónyai, Lajos; Mészáros, TamásEditor: Winkler, FranzDate: 2011.
- On a conjecture of László Rédei
- On a conjecture of Kemnitz
- On benchmarking frequent itemset mining algorithms: from measurement to analysis
Authors: Rácz, Balázs; Bodon, F.; Schmidt-Thieme, L.Date: 2005.
- nonordfp: an FP-growth variation without rebuilding the FP-tree
Authors: Rácz, BalázsEditor: Bayardo, R; Goethals, B; Zaki, MJDate: 2004.
- Főnévi csoportok azonosítása magyar-angol párhuzamos korpuszban
- A Hungarian NP Chunker
- High density compression of log files
- Two-phase data warehouse optimized for data mining
- Három halk visszhang
- Birkózás a bonyolultsággal
- Increasing cluster recall of cross-modal image retrieval
- Statistical multiple alignment
- Random constructions and density results
- On defining sets for projective planes
- Trie: an alternative datastructure for datamining
- On sets without tangents in planes of even order
Authors: Blokhuis, Aart; Szőnyi, Tamás; Weiner, ZsuzsaDate: 2003.
- Blocking sets in projective spaces
Authors: Blokhuis, Aart; Sziklai, Péter; Szőnyi, TamásEditor: De Beule, Jan; Storme, LeoDate: 2011.
- Incomplete pairwise comparison matrices in multi-attribute decision making
- On optimal completions of incomplete pairwise comparison matrices
- Véges projektív síkok
Authors: Bérzci, G.; Gács, A.; Szőnyi, TamásEditor: Hraskó, ADate: 2002.
- Véges projektív síkok
Authors: Bérzci, G.; Gács, A.; Hraskó, A.; Szőnyi, TamásEditor: Hraskó, ADate: 2002.
- City sentinel - VAST 2011 mini challenge 1 award: "Outstanding integration of computational and visual methods"
- On multiple blocking sets in Galois planes
Authors: Blokhuis, Aart; Lovász, László; Storme, Leo; Szőnyi, TamásDate: 2007.
- On q-analogues and stability theorems
Authors: Blokhuis, Aart; Brouwer, Andries; Szőnyi, Tamás; Weiner, ZsuzsaDate: 2011.
- On the asymptotic properties of a nonparametric L_1-test statistic of homogeneity
- Web spam: a survey with vision for the archivist
- KDD Cup 2007 task 1 winner report
- Strongly consistent model selection for densities
- Nonparametric sequental prediction of time series
Authors: Biau, Gérard; Blekley, Kevin; Györfi, László; Ottucsák, GyörgyDate: 2010. 04.
- Covering all points except one
- A Hilton-Milner theorem for vector spaces
Authors: Blokhuis, A.; Brouwer, A. E.; Chowdhury, A.; Frankl, P.; Mussche, T.; Patkos, B.; Szőnyi, TamásDate: 2010.
- Linked latent dirichlet allocation in web spam filtering
- Latent dirichlet allocation in web spam filtering
- A comparative analysis of latent variable models for web page classification
- Interest point and segmentation-based photo annotation
- SZTAKI @ ImageCLEF 2011
- SZTAKI @ ImageCLEF 2008 visual concept detection
- Dynamics of genome rearrangement in bacterial populations
- SZTAKI @ ImageCLEF 2010
- SZTAKI @ TRECVID 2010
- SZTAKI @ ImageCLEF 2009
- SZTAKI @ TRECVID 2009
- SZTAKI@ImageCLEF 2008: visual feature analysis in segmented images
- Streamlining and large ancestral genomes in Archaea inferred with a phylogenetic birth-and-death model
- Mi mennyi?
- Minkowski arrangements of circles in the plane
- Arrangements of 14, 15, 16 and 17 points on a sphere
- Arrangements of 13 points on a sphere
Authors: Böröczky, K.; Szabó, L.Editor: Bezdek, ADate: 2003.
- Minkowski arrangements of circles in the plane
- Minkowski arrangements of spheres
- Simple Lie algebras having extremal elements
- On the structure of optimal entropy-constrained scalar quantizers
- Random-order bin packing
Authors: Coffman, Edward G.; Csirik, János; Rónyai, Lajos; Zsbán, AmbrusDate: 2008.
- Deformable polygon representation and near-mincuts
Authors: Benczúr, András; Goemans, Michel X.Editor: Grötschel, M.; Katona, G. O. H.Date: 2008.
- Web spam challenge proposal for filtering in archives
- Data-dependent margin-based generalization bounds for classification
- Estimating the entropy of discrete distributions
- Convergence properties of functional estimates for discrete distributions
- Lower bounds on the rate of convergence of nonparametric regression estimates
- Nemparaméteres függvénybecslések
- Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path

- Innately transitive subgroups of wreath products in product action
- Transitive simple subgroups of wreath products in product action
- The rank of the endomorphism monoid of a uniform partition
- Individual convergence rates in empirical vector quantizer design
- Improved convergence rates in empirical vector quantizer design
- Shattering news
- Constructive membership testing in black-box classical groups
Authors: Ambrose, Sophie; Murray, Scott; Praeger, Cheryl; Schneider, CsabaDate: 2010.
- Generalised sifting in black-box groups
- Improved minimax bounds on the test and training distortion of empirically designed vector quantizers
- Improved minimax bounds on the test and training distortion of empirically designed vector quantizers

- Rawa trees
Authors: Antos, András; Devroye, L.Editor: Gardy, D; Mokkadem, ADate: 2000.
- On nonparametric estimates of the expectation
Authors: Antos, AndrásEditor: Berkes, I; Csáki, E; Csörgő, MDate: 2002.
- Lower bounds for the rate of convergence in nonparametric pattern recognition
- Intransitive Cartesian decompositions preserved by innately transitive permutation groups
- Graphs with the n-e.c. adjacency property constructed from affine planes
Authors: Baker, Catherine A.; Bonato, Anthony; Brown, Julia M. Nowlin; Szőnyi, TamásDate: 2008.
- Multimodal retrieval by text--segment biclustering
- Cross-modal retrieval by text and image feature biclustering
- Affordable supercomputing for data mining applications
- PageRank és azon túl: Hiperhivatkozások szerepe a keresésben
- Web spam detection via commercial intent analysis
- Link-based similarity search to fight web spam
- Semi-supervised learning: a comparative study for web spam and telephone user churn
- Detecting nepotistic links by language model disagreement
- Augmenting undirected edge connectivity in Ő(n2) time
- Fast algorithms for even/odd minimum cuts and generalizations
- Magyar nyelvű tartalom a világhálón
- Pushdown-reduce: an algorithm for connectivity augmentation and poset covering problems
- Note on disjoint blocking sets in Galois planes
Authors: Barát, János; Marcugini, S.; Pambianco, F.; Szőnyi, TamásDate: 2006.
- Searching a small national domain - preliminary report
- Formal description of a distributed location service for mobile ad hoc networks
- On the feasibility of low-rank approximation for personalized pagerank
- SpamRank - fully automatic link spam detection. Work in progress
- Algebra and computation at SZTAKI
- Finding splitting elements and maximal tori in matrix algebras
Authors: De Graaf, WA; Ivanyos, GáborEditor: Van Oystaeyen, F; Saorin, MDate: 2000.
- Root shadow spaces
- On the black-box complexity of Sperner's Lemma
Authors: Friedl, K.; Ivanyos, Gábor; Santha, M.; Verhoeven, YFDate: 2005.
- Efficient testing of groups
- Hidden translation and orbit coset in quantum computing
Authors: Friedl, K.; Ivanyos, Gábor; Magniez, F.; Santha, M.; Sen, P.Date: 2003.
- Towards scaling fully personalized pageRank
- Order shattering and Wilson's theorem
- Gröbner bases for complete l-wide families
Authors: Friedl, Katalin; Hegedűs, Gábor; Rónyai, LajosDate: 2007.
- Keresés a világhálón
Authors: Friedman, E.; Uher, M.; Windhager, E.Date: 2003.
- MCMC network: graphical interface for Bayesian analysis of metabolic networks
- On the black-box complexity of Sperner's Lemma
Authors: Friedl, Katalin; Ivanyos, Gábor; Santha, Miklos; Verhoeven, Yves F.Date: 2009.
- A scalable randomized method to compute link-based similarity rank on the web graph
- Towards scaling fully personalized pageRank
- Formal methods in computing
- Some meeting points of Gröbner bases and combinatorics
Authors: Felszeghy, Bálint; Rónyai, LajosEditor: Klin, M.; Jones, G. A.; Jurisic, A.; Muzychuk, M.; Ponomarenko, I.Date: 2009.
- The lex game and some applications
Authors: Felszeghy, Bálint; Ráth, Balázs; Rónyai, LajosDate: 2006.
- Algorithms on the Web graph
- Ranking the pages of the World Wide Web
- Klaszterezés
- Where to start browsing the Web
- Ranking the pages of the world wide web
- A magyar web
Authors: Friedman, E.; Uher, M.; Windhager, E.Date: 2003.
- SZTAKI @ TREC 2010
- Nonparametric nearest neighbor based empirical portfolio selection strategies
- Sequential prediction of unbounded stationary time series
- Nonparametric kernel-based sequential investment strategies
- Nonparametric estimation of conditional distributions
- Kernel-based semi-log-optimal empirical portfolio selection strategies
- Growth optimal investment with transaction costs
Authors: Györfi, László; Vajda, I.Editor: Freund, Y.; Györfi, László; Turán, G.; Zeugmann, Th.Date: 2008.
- Codecell convexity in optimal entropy-constrained vector quantization
- Codecell convexity in optimal entropy-constrained vector quantization
- Quantization for nonparametric regression
- Poisson limit of an inhomogeneous nearly critical INAR(1) model
Authors: Györfi, László; Ispány, Márton; Pap, Gyula; Varga, KatalinDate: 2007.
- Principles of stability analysis for random accessing with feedback
Authors: Györfi, László; Győri, Sándor; Massey, James L.Editor: Biglieri, Ezio; Györfi, LászlóDate: 2007.
- Nonparametric independence tests: space partitioning and kernel approaches
Authors: Gretton, A.; Györfi, LászlóEditor: Freund, Y.; Györfi, László; Turán, G.; Zeugmann, Th.Date: 2008.
- The grand challenge of computer Go: Monte Carlo Tree Search and Extensions
Authors: Gelly, Sylvain; Kocsis, Levente; Schoenauer, Marc; Sebag, Michèle; Silver, David; Szepesvári, Csaba; Teytaud, OlivierDate: 2012. 03.
- Performance of auctions and sealed bids
- Consistent Nonparamtric Tests of Independence
Authors: Gretton, Arthur; Györfi, LászlóEditor: Shawe-Taylor, JohnDate: 2010.
- Disjoint empty convex polygons in planar point sets
- Coding for multiple-access collision channel without feedback
Authors: Györfi, László; Győri, SándorEditor: Biglieri, Ezio; Györfi, LászlóDate: 2007.
- Analysis of collision channel with asynchronous access
- An efficient block model for clustering sparse graphs
- Algebraic properties of modulo q complete l-wide families
Authors: Felszeghy, Bálint; Hegedűs, Gábor; Rónyai, LajosDate: 2009.
- Scaling link-based similarity search
- Overview of the imageCLEF 2007 object retrieval task
Authors: Deselaers, Thomas; Hanbury, Allan; Viitaniemi, Ville; Benczúr, András; Brendel, Mátyás; Daróczy, Bálint Zoltán; Balderas, Hugo Jair Escalante; Gevers, Theo; Gracidas, Carlos Arturo Hernández; Hoi, Steven C. H.; Laaksonen, Jorma; Li, Mingjing; Castro, Heidy Marisol Marin; Ney, Hermann; Rui, Xiaoguang; Sebe, Nicu; Stöttinger, Julian; Wu, LeiDate: 2008.
- Overview of the imageCLEF 2007 object retrieval task
Authors: Deselaers, Thomas; Hanbury, Allan; Viitaniemi, Ville; Benczúr, András; Brendel, Mátyás; Daróczy, Bálint Zoltán; Balderas, Hugo Jair Escalante; Gevers, Theo; Gracidas, Carlos Arturo Hernández; Hoi, Steven C. H.; Laaksonen, Jorma; Li, Mingjing; Castro, Heidy Marisol Marin; Ney, Hermann; Rui, Xiaoguang; Sebe, Nicu; Stöttinger, Julian; Wu, LeiEditor: Nardi, A.; Peters, C.; Quochi, V.Date: 2007.
- On the lexicographic standard monomials of zero dimensional ideals
- A note on robust hypothesis testing
- OWLAP - using OLAP approach in anomaly detection
- Temporal analysis for web spam detection: an overview
- A combinatorial problem on polynomials and rational functions
- Query rewriting in relational databases
- Relációs adatbázisok funkcionális függőségi rendszereinek grafikus axiomatizációja
- An algebraic representation of frequent market baskets and association rules
- An algebraic approach to market basket model: explicit represenatation of frequent market baskets and associations rules
- Dependencies and generalized relations
- On the number of independent functional dependencies
- Functional dependencies distorted by errors
- Reasoning methods for designing and surveying relationships described by sets of functional constraints
- Graphs representimg sets of functional dependencies
- Web spam classification: a few features worth more
- Relational database design
- Flitter Mini Challenge Prize Winner: Good Analytical Debrief. Visualized Subgraph Search
- An inductive construction for plane Laman graphs via vertex splitting
Authors: Fekete, Zsolt; Jordán, Tibor; Whiteley, WalterDate: 2004.
- Source location with rigidity and tree packing requirements
- A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
- On the spectrum of pairwise comparison matrices
- ALGOSENSORS 2006, Lecture Notes in Computer Science
- Web spam filtering in internet archives
- Rigid realizations of graphs on small grids
- ON THE COMPOSITION AND DECOMPOSITION OF ATTRIBUTES AND TUPLES
- An illumination problem for convex polyhedra
- Performance limits of nonparametric estimators
- Algorithmic properties of maximal orders in simple algebras over Q
- Strong minimax lower bounds for learning
- A simple proof for the Jordan measurability of convex sets
- Regular circle packings
Authors: Szabó, L.Editor: Böröczky, K; Fejes Tóth, GDate: 1994.
- Konvex geometria. Egyetemi jegyzet
- Néhány kombinatorikus geometriai probléma.(Some problems in combinatorial geometry.)
- On the density of unit balls touching a unit cylinder
- Recent results on illumination problems
Authors: Szabó, L.Editor: Bárány, I; Böröczky, KDate: 1997.
- Algebrák és algoritmusok
- A simple randomized algorithm for sequential prediction of ergodic time series
- Lower bounds for Bayes error estimation
- A note on intersections of isotone clones
- Lattices in graphs with polynomial growth
- Clones and maximal sets in set logic containing all Boolean functions
- On local expansion of vertex-transitive graphs
- Functional dependencies among Boolean dependencies
- Equality schemes and equality scheme dependencies in relational databases
- Norm-graphs: variations and applications
- On plus-minus 1-representations of integers
- Computing Cartan subalgebras in Lie algebras
- Computing Levi decompositions in Lie algebras
- Lower bounds on the rate of convergence of nonparametric pattern recognition
- Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs
- lliptikus görbék és Fermat-sejtés
- Computations in associative and Lie algebras
- Augmenting undirected edge-connectivity in Ő(n2) time
- A deterministic method for computing splitting elements in simple algebras over Q
- Covering symmetric supermodular functions by graphs
- Dilworth's theorem and its application for path systems of a cycle-implementation and analysis
Authors: Benczúr, András; Förster, J.; Király, Z.Editor: Nesetril, JDate: 1999.
- Finding maximal orders in semisimple algebras over Q
- Decomposition of algebras over Fq(X1,...,Xm)
- Algoritmusok
- Prime-field-complete functions and factoring polynomials over finite fields
- Error estimation in pattern recognition
- Norm-graphs and bipartite Turán numbers
- Lattice basis reduction for indefinite forms and an application
- Finding the radical of matrix algebras using fitting decompositions
- Parallel and fast sequential algorithms for undirected edge connectivity augmentation
- Computations in associative algebras
Authors: Rónyai, LajosEditor: Finkelstein, L; Kantor, WMDate: 1993.
- Primitive illumination systems for families of convex bodies in the plane
Authors: Soltan, V.; Szabó, L.; Vásárhelyi, É.Date: 1997.
- Smallest limited vertex-to-vertex snakes of unit triangles
Authors: Harborth, Z.; Szabó, L.; Ujvári-Menyhárt, H.Date: 1999.
- Periodical scheduling
- Multiplicative equations over commuting matrices
Authors: Babai, L.; Beals, R.; Cai, J-Y; Ivanyos, Gábor; Luks, EMDate: 1996.
- Egy igazán csudálatos bizonyítás. (A truly marvelous proof.) (in Hungarian.)
- Fermat utolsó tétele
- Galois groups and factoring polynomials over finite fields
- Polynomial time algorithms for modules over finite dimensional algebras
- Scale-sensitive dimensions and skeleton estimates for classification
- Computations in finite-dimensional Lie algebras
- Finding the radical of an algebra of linear transformations
- Klasszikus képtárproblémák II