Sciweavers

3019 search results - page 126 / 604
» Approximating the Domatic Number
Sort
View
ICALP
2005
Springer
15 years 10 months ago
Optimal Spaced Seeds for Faster Approximate String Matching
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...
Martin Farach-Colton, Gad M. Landau, Süleyman...
CPM
2004
Springer
109views Combinatorics» more  CPM 2004»
15 years 10 months ago
Approximate Labelled Subtree Homeomorphism
Given two undirected trees T and P, the Subtree Homeomorphism Problem is to find whether T has a subtree t that can be transformed into P by removing entire subtrees, as well as ...
Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal ...
MM
2003
ACM
143views Multimedia» more  MM 2003»
15 years 10 months ago
Approximate matching algorithms for music information retrieval using vocal input
Effective use of multimedia collections requires efficient and intuitive methods of searching and browsing. This work considers databases which store music and explores how these...
Richard L. Kline, Ephraim P. Glinert
SSDBM
2002
IEEE
122views Database» more  SSDBM 2002»
15 years 10 months ago
ATreeGrep: Approximate Searching in Unordered Trees
An unordered labeled tree is a tree in which each node has a string label and the parent-child relationship is significant, but the order among siblings is unimportant. This pape...
Dennis Shasha, Jason Tsong-Li Wang, Huiyuan Shan, ...
SPAA
2010
ACM
15 years 10 months ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela