Sciweavers

1029 search results - page 12 / 206
» Compact representations of ordered sets
Sort
View
PAMI
2012
13 years 3 months ago
Aggregating Local Image Descriptors into Compact Codes
— This paper addresses the problem of large-scale image search. Three constraints have to be taken into account: search accuracy, efficiency, and memory usage. We first present...
Hervé Jégou, Florent Perronnin, Matt...
119
Voted
IJIT
2004
15 years 2 months ago
Consistent Hybrid Knowledge Representation in Order-Sorted Logic
Abstract-- We consider a hybrid knowledge representation system for ontological knowledge bases in order to maintain knowledge consistency between taxonomic knowledge and assertion...
Nwe Ni Tun, Satoshi Tojo
81
Voted
DM
1999
65views more  DM 1999»
15 years 8 days ago
Finite three dimensional partial orders which are not sphere orders
Abstract. Given a partially ordered set P = (X; P ), a function F which assigns to each x 2 X a set F (x) so that x y in P if and only if F (x) F (y) is called an inclusion represe...
Stefan Felsner, Peter C. Fishburn, William T. Trot...
102
Voted
DASFAA
2008
IEEE
150views Database» more  DASFAA 2008»
15 years 7 months ago
Approximate Clustering of Time Series Using Compact Model-Based Descriptions
Clustering time series is usually limited by the fact that the length of the time series has a significantly negative influence on the runtime. On the other hand, approximative c...
Hans-Peter Kriegel, Peer Kröger, Alexey Pryak...
85
Voted
DATE
2003
IEEE
85views Hardware» more  DATE 2003»
15 years 6 months ago
Set Manipulation with Boolean Functional Vectors for Symbolic Reachability Analysis
Symbolic techniques usually use characteristic functions for representing sets of states. Boolean functional vectors provide an alternate set representation which is suitable for ...
Amit Goel, Randal E. Bryant