Sciweavers

2121 search results - page 304 / 425
» Indexing Incomplete Databases
Sort
View
DOLAP
2003
ACM
15 years 11 months ago
Hierarchical dwarfs for the rollup cube
The data cube operator exemplifies two of the most important aspects of OLAP queries: aggregation and dimension hierarchies. In earlier work we presented Dwarf, a highly compress...
Yannis Sismanis, Antonios Deligiannakis, Yannis Ko...
MM
2003
ACM
165views Multimedia» more  MM 2003»
15 years 11 months ago
Video retrieval using spatio-temporal descriptors
This paper describes a novel methodology for implementing video search functions such as retrieval of near-duplicate videos and recognition of actions in surveillance video. Video...
Daniel DeMenthon, David S. Doermann
ADC
2010
Springer
218views Database» more  ADC 2010»
15 years 1 months ago
Stock risk mining by news
Due to the fast delivery of news articles by news providers on the Internet and/or via news datafeeds, it becomes an important research issue of predicting the risk of stocks by u...
Qi Pan, Hong Cheng, Di Wu, Jeffrey Xu Yu, Yiping K...
ICDE
2011
IEEE
274views Database» more  ICDE 2011»
14 years 9 months ago
Collaborative caching for spatial queries in Mobile P2P Networks
Abstract—We propose a novel collaborative caching framework to support spatial query processing in Mobile Peer-toPeer Networks (MP2PNs). To maximize cache sharing among clients, ...
Qijun Zhu, Dik Lun Lee, Wang-Chien Lee
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 8 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu