1716 search results - page 133 / 344 » Proving Conditional Termination |
114
Voted
SODA
2000
ACM
15 years 3 months ago
2000
ACM
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
126
click to vote
CGF
2010
15 years 2 months ago
2010
The technique of Delaunay refinement has been recognized as a versatile tool to generate Delaunay meshes of a variety of geometries. Despite its usefulness, it suffers from one la...
101
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
For general memoryless systems, the typical information theoretic solution - when exists - has a "single-letter" form. This reflects the fact that optimum performance ca...
107
click to vote
CORR
2006
Springer
15 years 2 months ago
2006
Springer
Abstract-- Variable length codes (VLCs) exhibit desynchronization problems when transmitted over noisy channels. Trellis decoding techniques based on Maximum A Posteriori (MAP) est...
102
Voted
CORR
2006
Springer
15 years 2 months ago
2006
Springer
We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem straction of fault-tolerant routing. We formally state the we...