Sciweavers

123 search results - page 23 / 25
» Efficient B-tree Based Indexing for Cloud Data Processing
Sort
View
SIGMOD
2010
ACM
132views Database» more  SIGMOD 2010»
13 years 15 days ago
Durable top-k search in document archives
We propose and study a new ranking problem in versioned databases. Consider a database of versioned objects which have different valid instances along a history (e.g., documents i...
Leong Hou U, Nikos Mamoulis, Klaus Berberich, Srik...
ICIP
1994
IEEE
14 years 7 months ago
Robust Optical Flow Estimation
Motion information is essential in many computer vision and video analysis tasks. Since MPEG is still one of the most prevalent formats for representing, transferring and storing ...
Sugata Ghosal, Rajiv Mehrotra
KDD
2000
ACM
222views Data Mining» more  KDD 2000»
13 years 9 months ago
Interactive exploration of very large relational datasets through 3D dynamic projections
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
Li Yang
SIGMOD
2007
ACM
160views Database» more  SIGMOD 2007»
14 years 6 months ago
Supporting ranking and clustering as generalized order-by and group-by
The Boolean semantics of SQL queries cannot adequately capture the "fuzzy" preferences and "soft" criteria required in non-traditional data retrieval applicati...
Chengkai Li, Min Wang, Lipyeow Lim, Haixun Wang, K...
SIGMOD
2009
ACM
258views Database» more  SIGMOD 2009»
14 years 6 months ago
Continuous obstructed nearest neighbor queries in spatial databases
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
Yunjun Gao, Baihua Zheng