Sciweavers

1709 search results - page 89 / 342
» Comparing the Performance of Database Selection Algorithms
Sort
View
130
Voted
ISMIR
2004
Springer
163views Music» more  ISMIR 2004»
15 years 10 months ago
Time-Warped Longest Common Subsequence Algorithm for Music Retrieval
Recent advances in music information retrieval have enabled users to query a database by singing or humming into a microphone. The queries are often inaccurate versions of the ori...
AnYuan Guo, Hava T. Siegelmann
SRDS
2006
IEEE
15 years 11 months ago
Topology Sensitive Replica Selection
As the disks typically found in personal computers grow larger, protecting data by replicating it on a collection of “peer” systems rather than on dedicated high performance s...
Dmitry Brodsky, Michael J. Feeley, Norman C. Hutch...
ICMCS
2007
IEEE
120views Multimedia» more  ICMCS 2007»
15 years 11 months ago
On the Error Resilience of Rate Smoothing using Explicit Slice-Based Mode Selection
An encoder based rate smoothing scheme which uses explicit slicebased mode selection has been proposed recently. The algorithm provides significantly smoother bitstream from a va...
Yuan Lin, Anna N. Kim, Eren Gürses, Andrew Pe...
ROBIO
2006
IEEE
129views Robotics» more  ROBIO 2006»
15 years 11 months ago
Learning Utility Surfaces for Movement Selection
— Humanoid robots are highly redundant systems with respect to the tasks they are asked to perform. This redundancy manifests itself in the number of degrees of freedom of the ro...
Matthew Howard, Michael Gienger, Christian Goerick...
SIGMOD
2009
ACM
144views Database» more  SIGMOD 2009»
16 years 5 months ago
Do we mean the same?: disambiguation of extracted keyword queries for database search
Users often try to accumulate information on a topic of interest from multiple information sources. In this case a user's informational need might be expressed in terms of an...
Elena Demidova, Irina Oelze, Peter Fankhauser