Sciweavers

779 search results - page 69 / 156
» Determining Time of Queries for Re-ranking Search Results
Sort
View
ICDE
2008
IEEE
162views Database» more  ICDE 2008»
14 years 9 months ago
Querying Complex Spatio-Temporal Sequences in Human Motion Databases
Content-based retrieval of spatio-temporal patterns from human motion databases is inherently nontrivial since finding effective distance measures for such data is difficult. These...
Yueguo Chen, Shouxu Jiang, Beng Chin Ooi, Anthony ...
VLDB
2008
ACM
140views Database» more  VLDB 2008»
14 years 8 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
VLDB
2001
ACM
115views Database» more  VLDB 2001»
14 years 4 days ago
Dynamic Update Cube for Range-sum Queries
A range-sum query is very popular and becomes important in finding trends and in discovering relationships between attributes in diverse database applications. It sums over the se...
Seok-Ju Chun, Chin-Wan Chung, Ju-Hong Lee, Seok-Ly...
COMPGEOM
2010
ACM
14 years 24 days ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
CIKM
2008
Springer
13 years 9 months ago
Improve the effectiveness of the opinion retrieval and opinion polarity classification
Opinion retrieval is a document retrieving and ranking process. A relevant document must be relevant to the query and contain opinions toward the query. Opinion polarity classific...
Wei Zhang, Lifeng Jia, Clement T. Yu, Weiyi Meng