3946 search results - page 96 / 790 » The computational complexity of choice sets |
102
click to vote
COMPGEOM
2008
ACM
15 years 1 months ago
2008
ACM
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...
VL
2006
IEEE
15 years 5 months ago
2006
IEEE
To explore how people conceptualize a complex system, 232 university students were asked to sketch how a search engine works. While the sketches reveal a diverse range of visual a...
110
click to vote
CINQ
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
IEEEPACT
2002
IEEE
15 years 4 months ago
2002
IEEE
Memory dependence prediction allows out-of-order issue processors to achieve high degrees of instruction level parallelism by issuing load instructions at the earliest time withou...
144
click to vote
AAAI
2011
13 years 12 months ago
2011
Inspired by “GoogleTM Sets” and Bayesian sets, we consider the problem of retrieving complex objects and relations among them, i.e., ground atoms from a logical concept, given...