1538 search results - page 139 / 308 » Spectral Techniques in Graph Algorithms |
130
click to vote
SIGMOD
2003
ACM
16 years 1 months ago
2003
ACM
Most previous solutions to the schema matching problem rely in some fashion upon identifying "similar" column names in the schemas to be matched, or by recognizing commo...
137
click to vote
ICCV
2007
IEEE
16 years 3 months ago
2007
IEEE
Object tracking is viewed as a two-class 'one-versusrest' classification problem, in which the sample distribution of the target is approximately Gaussian while the back...
213
click to vote
ICDE
2005
IEEE
16 years 2 months ago
2005
IEEE
A reverse nearest neighbor (RNN) query returns the data objects that have a query point as their nearest neighbor (NN). Although such queries have been studied quite extensively in...
106
click to vote
WEBDB
2004
Springer
15 years 7 months ago
2004
Springer
XML and semi-structured data is usually modeled using graph structures. Structural summaries, which have been proposed to speedup XML query processing have graph forms as well. Th...
137
click to vote
INFOVIS
1997
IEEE
15 years 5 months ago
1997
IEEE
We present the H3 layout technique for drawing large directed graphs as node-link diagrams in 3D hyperbolic space. We can lay out much larger structures than can be handled using ...