325 search results - page 41 / 65 » Alternatives to two classic data structures |
ECCC
2010
14 years 9 months ago
2010
We study a variant of the classical circuit-lower-bound problems: proving lower bounds for sampling distributions given random bits. We prove a lower bound of 1 - 1/n(1) on the st...
82
Voted
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We show that physical devices that perform observation, prediction, or recollection share an underlying mathematical structure. We call devices with that structure “inference de...
JAIR
2010
14 years 8 months ago
2010
In the usual models of cooperative game theory, the outcome of a coalition formation process is either the grand coalition or a coalition structure that consists of disjoint coali...
EDBT
2009
ACM
15 years 4 months ago
2009
ACM
NAND Flash has become the most popular stable storage medium for embedded systems. As on-board storage capacity increases, the need for efficient indexing techniques arises. Such ...
72
Voted
ECCV
2002
Springer
15 years 11 months ago
2002
Springer
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...