Sciweavers

514 search results - page 7 / 103
» Approximate Periods of Strings
Sort
View
JAT
2008
57views more  JAT 2008»
13 years 7 months ago
Sharp approximations to the Bernoulli periodic functions by trigonometric polynomials
We obtain optimal trigonometric polynomials of a given degree N that majorize, minorize and approximate in L1(R/Z) the Bernoulli periodic functions. These are the periodic analogue...
Emanuel Carneiro
TCS
2002
13 years 7 months ago
Presentations of computably enumerable reals
We study the relationship between a computably enumerable real and its presentations: ways of approximating the real by enumerating a prefix-free set of binary strings.
Rodney G. Downey, Geoffrey LaForte
JSA
2008
124views more  JSA 2008»
13 years 7 months ago
Processor array architectures for flexible approximate string matching
In this paper, we present linear processor array architectures for flexible approximate string matching. These architectures are based on parallel realization of dynamic programmi...
Panagiotis D. Michailidis, Konstantinos G. Margari...
RTAS
2010
IEEE
13 years 6 months ago
Approximate Bandwidth Allocation for Fixed-Priority-Scheduled Periodic Resources
Recent research in compositional real-time systems has focused on determination of a component’s real-time interface parameters. An important objective in interface-parameter de...
Farhana Dewan, Nathan Fisher
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
14 years 8 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li