Sciweavers

2944 search results - page 183 / 589
» Improving Bound Propagation
Sort
View
GC
2011
Springer
13 years 1 months ago
A Note on the Complexity of Real Algebraic Hypersurfaces
Given an algebraic hypersurface O in Êd, how many simplices are necessary for a simplicial complex isotopic to O? We address this problem and the variant where all vertices of the...
Michael Kerber, Michael Sagraloff
COR
2007
183views more  COR 2007»
13 years 10 months ago
Arcs-states models for the vehicle routing problem with time windows and related problems
This paper presents several Arcs-States models that can be applied to numerous vehicle routing problems, one of which is the well-known vehicle routing problem with capacities and...
Thierry Mautor, Edith Naudin
TIT
2008
94views more  TIT 2008»
13 years 10 months ago
Why Do Block Length and Delay Behave Differently if Feedback Is Present?
Abstract--For output-symmetric discrete memoryless channels (DMCs) at even moderately high rates, fixed-block-length communication systems show no improvements in their error expon...
Anant Sahai
TIT
2010
150views Education» more  TIT 2010»
13 years 5 months ago
Information-theoretic key agreement of multiple terminals: part I
This is the first part of a two-part paper on information-theoretically secure secret key agreement. In this part, we study the secrecy problem under the widely studied source mod...
Amin Aminzadeh Gohari, Venkat Anantharam
TCC
2009
Springer
151views Cryptology» more  TCC 2009»
14 years 11 months ago
Secret Sharing and Non-Shannon Information Inequalities
The known secret-sharing schemes for most access structures are not efficient; even for a one-bit secret the length of the shares in the schemes is 2O(n) , where n is the number of...
Amos Beimel, Ilan Orlov