3946 search results - page 368 / 790 » The computational complexity of choice sets |
155
click to vote
COMPGEOM
2000
ACM
15 years 11 months ago
2000
ACM
Let A be the incidence matrix of a set system with m sets and n points, m ≤ n, and let t = tr M, where M = AT A. Finally, let σ = tr M2 be the sum of squares of the elements of ...
201
click to vote
MST
2010
15 years 5 months ago
2010
Reductions and completeness notions form the heart of computational complexity theory. Recently non-uniform reductions have been naturally introduced in a variety of settings conc...
182
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
Discovering complex associations, anomalies and patterns in distributed data sets is gaining popularity in a range of scientific, medical and business applications. Various algor...
233
click to vote
ISMB
2000
15 years 8 months ago
2000
Several microarray technologies that monitor the level of expression of a large number of genes have recently emerged. Given DNA-microarray data for a set of cells characterized b...
214
click to vote
ECCV
2006
Springer
16 years 8 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...