Sciweavers

4850 search results - page 535 / 970
» Approximate Data Structures with Applications
Sort
View
SIGMOD
2008
ACM
90views Database» more  SIGMOD 2008»
16 years 7 months ago
Toward best-effort information extraction
Current approaches to develop information extraction (IE) programs have largely focused on producing precise IE results. As such, they suffer from three major limitations. First, ...
Warren Shen, Pedro DeRose, Robert McCann, AnHai Do...
WEBDB
2009
Springer
104views Database» more  WEBDB 2009»
16 years 1 months ago
Entity Search with NECESSITY
Loosely structured heterogeneous information spaces are typically created by merging data from a variety of different applications and information sources. A common problem these...
Ekaterini Ioannou, Saket Sathe, Nicolas Bonvin, An...
EMMCVPR
2007
Springer
16 years 1 months ago
Bayesian Order-Adaptive Clustering for Video Segmentation
Video segmentation requires the partitioning of a series of images into groups that are both spatially coherent and smooth along the time axis. We formulate segmentation as a Bayes...
Peter Orbanz, Samuel Braendle, Joachim M. Buhmann
ICDE
2005
IEEE
146views Database» more  ICDE 2005»
16 years 24 days ago
Best Effort Query Processing in DHT-based P2P Systems
Structured P2P systems in the form of distributed hash tables (DHT) are a promising approach for building massively distributed data management platforms. However, for many applic...
Philipp Rösch, Kai-Uwe Sattler, Christian von...
ISMIR
2005
Springer
175views Music» more  ISMIR 2005»
16 years 21 days ago
A Classification Approach to Melody Transcription
Melodies provide an important conceptual summarization of polyphonic audio. The extraction of melodic content has practical applications ranging from content-based audio retrieval...
Graham E. Poliner, Daniel P. W. Ellis