5221 search results - page 802 / 1045 » An On-line Problem Database |
174
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
227
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
Data exchange is the problem of transforming data structured under a schema (called source) into data structured under a different schema (called target). The emphasis of data exc...
133
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
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...
181
click to vote
WWW
2010
ACM
16 years 1 months ago
2010
ACM
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
179
click to vote
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
– Keyword search (KWS) over relational data, where the answers are multiple tuples connected via joins, has received significant attention in the past decade. Numerous solutions ...