Sciweavers

514 search results - page 51 / 103
» Approximate Periods of Strings
Sort
View
TSP
2010
13 years 2 months ago
Quasi-interpolation by means of filter-banks
We consider the problem of approximating a regular function f(t) from its samples, f(nT), taken in a uniform grid. Quasi-interpolation schemes approximate f(t) with a dilated versi...
Gerardo Pérez-Villalón
USENIX
1994
13 years 9 months ago
A Better Update Policy
y-filled data block results in a delayed write,Abstract while a modification that fills a block results in an immediate, although asynchronous, write. TheSome file systems can dela...
Jeffrey C. Mogul
SIGIR
1998
ACM
14 years 7 days 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...
IJSNET
2008
125views more  IJSNET 2008»
13 years 8 months ago
Minimum-cost sensor arrangement for achieving wanted coverage lifetime
: Suppose we need to watch a set of targets continuously for a required period of time, and suppose we choose any number of sensors from a fixed set of sensor types and place them ...
Jie Wang, Ning Zhong
JC
2010
117views more  JC 2010»
13 years 2 months ago
Tractability through increasing smoothness
We prove that some multivariate linear tensor product problems are tractable in the worst case setting if they are defined as tensor products of univariate problems with logarithm...
Anargyros Papageorgiou, Henryk Wozniakowski