2976 search results - page 484 / 596 » On the bounded integer programming |
166
click to vote
HYBRID
2007
Springer
16 years 16 days ago
2007
Springer
We provide an asymptotically tight, computationally efficient approximation of the joint spectral radius of a set of matrices using sum of squares (SOS) programming. The approach i...
171
click to vote
ICALP
2007
Springer
16 years 16 days ago
2007
Springer
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
160
click to vote
ICALP
2007
Springer
16 years 16 days ago
2007
Springer
We present a new meshing algorithm for the plane, Overlay Stitch Meshing (OSM), accepting as input an arbitrary Planar Straight Line Graph and producing a triangulation with all an...
169
click to vote
ICALP
2007
Springer
16 years 16 days ago
2007
Springer
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we c...
141
click to vote
ICALP
2007
Springer
16 years 16 days ago
2007
Springer
We present a streaming algorithm for constructing sparse spanners and show that our algorithm out-performs significantly the state-of-the-art algorithm for this task [20]. Speci...