2233 search results - page 88 / 447 » On the Complexity of Theory Curbing |
188
click to vote
ECAL
2007
Springer
16 years 14 days ago
2007
Springer
The “order for free” exhibited by some classes of system has been exploited by natural selection in order to build systems capable of exhibiting complex behaviour. Here we expl...
147
click to vote
SMI
2005
IEEE
15 years 12 months ago
2005
IEEE
Shape complexity has recently received attention from different fields, such as computer vision and psychology. In this paper, integral geometry and information theory tools are ...
147
click to vote
ALT
2004
Springer
16 years 3 months ago
2004
Springer
Rademacher and Gaussian complexities are successfully used in learning theory for measuring the capacity of the class of functions to be learned. One of the most important propert...
166
click to vote
STOC
2007
ACM
16 years 6 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....
183
click to vote
COCOON
2003
Springer
15 years 11 months ago
2003
Springer
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique c...