Sciweavers

44 search results - page 7 / 9
» Query clustering using click-through graph
Sort
View
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
13 years 4 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...
SIGMOD
2005
ACM
194views Database» more  SIGMOD 2005»
13 years 11 months ago
STRG-Index: Spatio-Temporal Region Graph Indexing for Large Video Databases
In this paper, we propose new graph-based data structure and indexing to organize and retrieve video data. Several researches have shown that a graph can be a better candidate for...
JeongKyu Lee, Jung-Hwan Oh, Sae Hwang
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
IEICET
2010
92views more  IEICET 2010»
13 years 4 months ago
Spectral Methods for Thesaurus Construction
Traditionally, popular synonym acquisition methods are based on the distributional hypothesis, and a metric such as Jaccard coefficients is used to evaluate the similarity between...
Nobuyuki Shimizu, Masashi Sugiyama, Hiroshi Nakaga...
SIGMOD
2010
ACM
214views Database» more  SIGMOD 2010»
13 years 11 months ago
ParaTimer: a progress indicator for MapReduce DAGs
Time-oriented progress estimation for parallel queries is a challenging problem that has received only limited attention. In this paper, we present ParaTimer, a new type of timere...
Kristi Morton, Magdalena Balazinska, Dan Grossman