Sciweavers

215 search results - page 27 / 43
» On the Linear Number of Matching Substrings
Sort
View
STOC
2012
ACM
201views Algorithms» more  STOC 2012»
11 years 10 months ago
From irreducible representations to locally decodable codes
Locally Decodable Code (LDC) is a code that encodes a message in a way that one can decode any particular symbol of the message by reading only a constant number of locations, eve...
Klim Efremenko
ICML
2007
IEEE
14 years 8 months ago
Supervised clustering of streaming data for email batch detection
We address the problem of detecting batches of emails that have been created according to the same template. This problem is motivated by the desire to filter spam more effectivel...
Peter Haider, Ulf Brefeld, Tobias Scheffer
IWCM
2004
Springer
14 years 1 months ago
Divide-and-Conquer Strategies for Estimating Multiple Transparent Motions
Abstract. Motion estimation is essential in a variety of image processing and computer vision tasks, like video coding, tracking, directional filtering and denoising, scene analys...
Cicero Mota, Ingo Stuke, Til Aach, Erhardt Barth
COMPGEOM
2000
ACM
14 years 7 days ago
When crossings count - approximating the minimum spanning tree
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
Sariel Har-Peled, Piotr Indyk
ALGORITHMICA
1999
102views more  ALGORITHMICA 1999»
13 years 7 months ago
Approximating Latin Square Extensions
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
Ravi Kumar, Alexander Russell, Ravi Sundaram