Sciweavers

3044 search results - page 247 / 609
» Linear logical approximations
Sort
View
FUIN
2006
98views more  FUIN 2006»
15 years 6 months ago
On-line Approximate String Matching in Natural Language
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
Kimmo Fredriksson
MST
2010
187views more  MST 2010»
15 years 1 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda
273
Voted
ICDE
2004
IEEE
121views Database» more  ICDE 2004»
16 years 8 months ago
Online Amnesic Approximation of Streaming Time Series
The past decade has seen a wealth of research on time series representations, because the manipulation, storage, and indexing of large volumes of raw time series data is impractic...
Themistoklis Palpanas, Michail Vlachos, Eamonn J. ...
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 7 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
ICALP
2010
Springer
15 years 11 months ago
Cell Probe Lower Bounds and Approximations for Range Mode
The mode of a multiset of labels, is a label that occurs at least as often as any other label. The input to the range mode problem is an array A of size n. A range query [i, j] mus...
Mark Greve, Allan Grønlund Jørgensen...