Sciweavers

1160 search results - page 136 / 232
» A Colour Object Search Algorithm
Sort
View
126
Voted
VLDB
1990
ACM
106views Database» more  VLDB 1990»
15 years 7 months ago
The Time Index: An Access Structure for Temporal Data
In this paper, we describe a new indexing technique, the time indez, for improving the performance of certain classes of temporal queries. The time index can be used to retrieve v...
Ramez Elmasri, Gene T. J. Wuu, Yeong-Joon Kim
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
15 years 6 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen
NIPS
2004
15 years 4 months ago
Euclidean Embedding of Co-Occurrence Data
Embedding algorithms search for low dimensional structure in complex data, but most algorithms only handle objects of a single type for which pairwise distances are specified. Thi...
Amir Globerson, Gal Chechik, Fernando C. Pereira, ...
IJCV
2002
112views more  IJCV 2002»
15 years 2 months ago
Range Segmentation Using Visibility Constraints
Visibility constraints can aid the segmentation of foreground objects in a scene observed with multiple range imagers. Points may be labeled as foreground if they can be determine...
Leonid Taycher, Trevor Darrell
ICDE
2005
IEEE
156views Database» more  ICDE 2005»
16 years 4 months ago
Reverse Nearest Neighbors in Large Graphs
A reverse nearest neighbor (RNN) query returns the data objects that have a query point as their nearest neighbor (NN). Although such queries have been studied quite extensively in...
Man Lung Yiu, Dimitris Papadias, Nikos Mamoulis, Y...