1272 search results - page 96 / 255 » Approximate Parameterized Matching |
117
Voted
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
141
Voted
STOC
1998
ACM
15 years 7 months ago
1998
ACM
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
148
Voted
INFOCOM
2003
IEEE
15 years 8 months ago
2003
IEEE
— In all-optical networks that use WDM technology it is often the case that several communication requests have to be blocked, due to bandwidth and technology limitations. Minimi...
106
Voted
LREC
2010
15 years 5 months ago
2010
This paper compares several indexing methods for person names extracted from text, developed for an information retrieval system with requirements for fast approximate matching of...
98
Voted
SPIRE
2004
Springer
15 years 8 months ago
2004
Springer
This paper presents a generalization of the notion of longest repeats with a block of k don’t care symbols introduced by [8] (for k fixed) to longest motifs composed of three pa...