Sciweavers

1283 search results - page 122 / 257
» Probabilistic structured query methods
Sort
View
ISMIR
2005
Springer
123views Music» more  ISMIR 2005»
14 years 2 months ago
Polyphonic Musical Sequence Alignment for Database Search
Finding the best matching database target to a melodic query has been of great interest in the music IR world. The string alignment paradigm works well for this task when comparin...
Bryan Pardo, Manan Sanghi
ICDE
2008
IEEE
157views Database» more  ICDE 2008»
14 years 10 months ago
TALE: A Tool for Approximate Large Graph Matching
Abstract-- Large graph datasets are common in many emerging database applications, and most notably in large-scale scientific applications. To fully exploit the wealth of informati...
Yuanyuan Tian, Jignesh M. Patel
DASFAA
2007
IEEE
148views Database» more  DASFAA 2007»
14 years 28 days ago
An Efficient Encoding and Labeling for Dynamic XML Data
In order to efficiently determine structural relationships among XML elements and to avoid re-labeling for updates, much research about labeling schemes has been conducted, recentl...
Jun-Ki Min, Jihyun Lee, Chin-Wan Chung
COMPGEOM
2005
ACM
13 years 11 months ago
The skip quadtree: a simple dynamic data structure for multidimensional data
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
David Eppstein, Michael T. Goodrich, Jonathan Z. S...
SCP
2010
96views more  SCP 2010»
13 years 7 months ago
Enforcing structural regularities in software using IntensiVE
The design and implementation of a software system is often governed by a variety of coding conventions, design patterns, architectural guidelines, design rules, and other so-call...
Johan Brichau, Andy Kellens, Sergio Castro, Theo D...