Sciweavers

1612 search results - page 210 / 323
» Asynchronous Pattern Matching
Sort
View
161
Voted
OPODIS
2004
15 years 5 months ago
Self-optimizing DHTs Using Request Profiling
S (in alphabetic order by speaker surname) Speaker: Uri Abraham (Ben-Gurion University) Title: Self-Stabilizing TimeStamps : Speaker: Anish Arora (Ohio State) Title: Self-Stabilizi...
Alina Bejan, Sukumar Ghosh
COMPGEOM
2009
ACM
15 years 11 months ago
Coresets for polytope distance
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
Bernd Gärtner, Martin Jaggi
SIGIR
1998
ACM
15 years 8 months ago
Fast Searching on Compressed Text Allowing Errors
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...
ISMIR
2000
Springer
128views Music» more  ISMIR 2000»
15 years 8 months ago
PROMS: A Web-based Tool for Searching in Polyphonic Music
One major task of a digital music library (DML) is to provide techniques to locate a queried musical pattern in all pieces of music in the database containing that pattern. For a ...
Michael Clausen, R. Engelbrecht, D. Meyer, J. Schm...
PR
2008
206views more  PR 2008»
15 years 4 months ago
A study of graph spectra for comparing graphs and trees
The spectrum of a graph has been widely used in graph theory to characterise the properties of a graph and extract information from its structure. It has also been employed as a g...
Richard C. Wilson, Ping Zhu