Sciweavers

1038 search results - page 168 / 208
» Space-Bounded Query Approximation
Sort
View
EDBT
2004
ACM
121views Database» more  EDBT 2004»
15 years 12 months ago
LexEQUAL: Supporting Multiscript Matching in Database Systems
To effectively support today's global economy, database systems need to store and manipulate text data in multiple languages simultaneously. Current database systems do suppor...
A. Kumaran, Jayant R. Haritsa
CIVR
2006
Springer
126views Image Analysis» more  CIVR 2006»
15 years 3 months ago
Semantics Supervised Cluster-Based Index for Video Databases
High-dimensional index is one of the most challenging tasks for content-based video retrieval (CBVR). Typically, in video database, there exist two kinds of clues for query: visual...
Zhiping Shi, Qingyong Li, Zhiwei Shi, Zhongzhi Shi
PVLDB
2008
116views more  PVLDB 2008»
14 years 11 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan
STOC
2002
ACM
144views Algorithms» more  STOC 2002»
16 years 18 hour ago
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
Surender Baswana, Ramesh Hariharan, Sandeep Sen
ALGORITHMICA
2011
14 years 6 months ago
On Bounded Leg Shortest Paths Problems
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
Liam Roditty, Michael Segal