Sciweavers

1672 search results - page 116 / 335
» Tightness problems in the plane
Sort
View
APPROX
2004
Springer
89views Algorithms» more  APPROX 2004»
14 years 1 months ago
The Sketching Complexity of Pattern Matching
Abstract. We address the problems of pattern matching and approximate pattern matching in the sketching model. We show that it is impossible to compress the text into a small sketc...
Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, ...
COLING
1994
13 years 11 months ago
Morphology with a Null-Interface
We present an integrated architecture for word-level and sentence-level processing in a unification-based paradigm. The core of the system is a CLP implementation of a nnilication...
Harald Trost, Johannes Matiasek
WINE
2010
Springer
213views Economy» more  WINE 2010»
13 years 8 months ago
The Efficiency of Fair Division with Connected Pieces
der the issue of fair division of goods, using the cake cutting abstraction, and aim to bound the possible degradation in social welfare due to the fairness requirements. Previous...
Yonatan Aumann, Yair Dombb
ARITH
2011
IEEE
12 years 10 months ago
Short Division of Long Integers
—We consider the problem of short division — i.e., approximate quotient — of multiple-precision integers. We present ready-to-implement algorithms that yield an approximation...
David Harvey, Paul Zimmermann
COMSNETS
2012
176views more  COMSNETS 2012»
12 years 5 months ago
Capacity of Byzantine consensus in capacity limited point-to-point networks
—In this paper, we investigate the problem of maximizing the throughput, i.e., achieving capacity, of Byzantine consensus in point-to-point networks, in which each link has a cap...
Guanfeng Liang, Nitin H. Vaidya