Sciweavers

1626 search results - page 261 / 326
» Spatial-Scene Similarity Queries
Sort
View
96
Voted
SIGSOFT
2009
ACM
16 years 18 days ago
DebugAdvisor: a recommender system for debugging
In large software development projects, when a programmer is assigned a bug to fix, she typically spends a lot of time searching (in an ad-hoc manner) for instances from the past ...
B. Ashok, Joseph M. Joy, Hongkang Liang, Sriram K....
WWW
2008
ACM
16 years 16 days ago
Using subspace analysis for event detection from web click-through data
Although most of existing research usually detects events by analyzing the content or structural information of Web documents, a recent direction is to study the usage data. In th...
Ling Chen 0002, Yiqun Hu, Wolfgang Nejdl
KDD
2007
ACM
186views Data Mining» more  KDD 2007»
16 years 8 days ago
Content-based document routing and index partitioning for scalable similarity-based searches in a large corpus
We present a document routing and index partitioning scheme for scalable similarity-based search of documents in a large corpus. We consider the case when similarity-based search ...
Deepavali Bhagwat, Kave Eshghi, Pankaj Mehra
SIGMOD
2004
ACM
149views Database» more  SIGMOD 2004»
16 years 16 hour ago
Incremental Maintenance of XML Structural Indexes
Increasing popularity of XML in recent years has generated much interest in query processing over graph-structured data. To support efficient evaluation of path expressions, many ...
Ke Yi, Hao He, Ioana Stanoi, Jun Yang 0001
73
Voted
ICDE
2010
IEEE
371views Database» more  ICDE 2010»
15 years 11 months ago
TASM: Top-k Approximate Subtree Matching
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...