3415 search results - page 24 / 683 » Lower Bounds for Kernelizations |
JGT
2006
13 years 11 months ago
2006
We find a lower bound for the proportion of face boundaries of an embedded graph that are nearly
PAKDD
2009
ACM
14 years 3 months ago
2009
ACM
We propose a new method, called SimClus, for clustering with lower bound on similarity. Instead of accepting k the number of clusters to find, the alternative similarity-based app...
ALT
1998
Springer
14 years 3 months ago
1998
Springer
Exact learning of half-spaces over finite subsets of IRn from membership queries is considered. We describe the minimum set of labelled examples separating the target concept from ...
STOC
2007
ACM
14 years 11 months ago
2007
ACM
We introduce a new method to derive lower bounds on randomized and quantum communication complexity. Our method is based on factorization norms, a notion from Banach Space theory....
LICS
2009
IEEE
14 years 5 months ago
2009
IEEE
Automata on infinite words (ω-automata) have wide applications in formal language theory as well as in modeling and verifying reactive systems. Complementation of ωautomata is ...