Sciweavers

1091 search results - page 48 / 219
» On the temporal dimension of search
Sort
View
VLDB
2008
ACM
140views Database» more  VLDB 2008»
16 years 1 months ago
Efficient temporal counting with bounded error
This paper studies aggregate search in transaction time databases. Specifically, each object in such a database can be modeled as a horizontal segment, whose y-projection is its s...
Yufei Tao, Xiaokui Xiao
DAWAK
2005
Springer
15 years 7 months ago
Nearest Neighbor Search on Vertically Partitioned High-Dimensional Data
Abstract. In this paper, we present a new approach to indexing multidimensional data that is particularly suitable for the efficient incremental processing of nearest neighbor quer...
Evangelos Dellis, Bernhard Seeger, Akrivi Vlachou
PCM
2001
Springer
183views Multimedia» more  PCM 2001»
15 years 6 months ago
An Adaptive Index Structure for High-Dimensional Similarity Search
A practical method for creating a high dimensional index structure that adapts to the data distribution and scales well with the database size, is presented. Typical media descrip...
Peng Wu, B. S. Manjunath, Shivkumar Chandrasekaran
CN
2002
116views more  CN 2002»
15 years 1 months ago
Search engines and Web dynamics
In this paper we study several dimensions of web dynamics in the context of large-scale Internet search engines. Both growth and update dynamics clearly represent big challenges f...
Knut Magne Risvik, Rolf Michelsen
CORR
2010
Springer
112views Education» more  CORR 2010»
15 years 1 months ago
Transdichotomous Results in Computational Geometry, II: Offline Search
We reexamine fundamental problems from computational geometry in the word RAM model, where input coordinates are integers that fit in a machine word. We develop a new algorithm fo...
Timothy M. Chan, Mihai Patrascu