3415 search results - page 387 / 683 » Lower bounds on kernelization |
173
click to vote
COLT
2010
Springer
15 years 4 months ago
2010
Springer
In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory commun...
170
click to vote
ECCC
2011
15 years 1 months ago
2011
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
198
click to vote
BIOINFORMATICS
2011
14 years 10 months ago
2011
We consider the problem of similarity queries in biological network databases. Given a database of networks, similarity query returns all the database networks whose similarity (i...
223
click to vote
SIGMOD
2012
ACM
13 years 9 months ago
2012
ACM
We study the notion of regret ratio proposed in [19] to deal with multi-criteria decision making in database systems. The regret minimization query proposed in [19] was shown to h...
149
click to vote
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...