Sciweavers

1089 search results - page 147 / 218
» Bounds on generalized Frobenius numbers
Sort
View
IJFCS
2002
58views more  IJFCS 2002»
13 years 8 months ago
Vector Algorithms for Approximate String Matching
Vector algorithms allow the computation of an output vector r = r1r2 :::rm given an input vector e = e1e2 :::em in a bounded number of operations, independent of m the length of t...
Anne Bergeron, Sylvie Hamel
TIT
1998
70views more  TIT 1998»
13 years 8 months ago
The Poisson Multiple-Access Channel
—The Poisson multiple-access channel (MAC) models many-to-one optical communication through an optical fiber or in free space. For this model we compute the capacity region for ...
Amos Lapidoth, Shlomo Shamai
TIP
2010
136views more  TIP 2010»
13 years 7 months ago
Wavelet Steerability and the Higher-Order Riesz Transform
Abstract— Our main goal in this paper is to set the foundations of a general continuous-domain framework for designing steerable, reversible signal transformations (a.k.a. frames...
Michael Unser, Dimitri Van De Ville
AI
2011
Springer
13 years 4 months ago
The extended global cardinality constraint: An empirical survey
The Extended Global Cardinality Constraint (EGCC) is a vital component of constraint solving systems, since it is very widely used to model diverse problems. The literature contai...
Peter Nightingale
CORR
2011
Springer
155views Education» more  CORR 2011»
13 years 3 months ago
Subexponential convergence for information aggregation on regular trees
— We consider the decentralized binary hypothesis testing problem on trees of bounded degree and increasing depth. For a regular tree of depth t and branching factor k ≥ 2, we ...
Yashodhan Kanoria, Andrea Montanari