380 search results - page 4 / 76 » A Categorical Setting for Lower Complexity |
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
We present two new fundamental lower bounds on the worst-case combinatorial complexity of sets of free lines and sets of maximal free line segments in the presence of balls in thr...
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
A fast-growing body of research in the AI and machine learning communities addresses learning in games, where there are multiple learners with different interests. This research a...
ECCV
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. This contribution proposes a compositional approach to visual object categorization of scenes. Compositions are learned from the Caltech 101 database1 intermediate abstra...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
— The problem of designing high rate, full diversity noncoherent space-time block codes (STBCs) with low encoding and decoding complexity is addressed. First, the notion of g-gro...
JC
2007
14 years 9 months ago
2007
We extend the lower bounds on the complexity of computing Betti numbers proved in [6] to complex algebraic varieties. More precisely, we first prove that the problem of deciding ...