1029 search results - page 5 / 206 » Compact representations of ordered sets |
BSL
2005
13 years 7 months ago
2005
This communication deals with positive model theory, a non first order model theoretic setting which preserves compactness at the cost of giving up negation. Positive model theory ...
ANOR
2008
13 years 7 months ago
2008
: Semiorders may form the simplest class of ordered sets with a not necessarily transitive indifference relation. Their generalization has given birth to many other classes of orde...
WACV
2012
IEEE
12 years 3 months ago
2012
IEEE
We present a novel algorithm, Compact Kd-Trees (CompactKdt), that achieves state-of-the-art performance in searching large scale object image collections. The algorithm uses an or...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...
ICPR
2008
IEEE
14 years 8 months ago
2008
IEEE
We present a new method for compact representation of large image datasets. Our method is based on treating small patches from an image as matrices as opposed to the conventional ...