Sciweavers

676 search results - page 52 / 136
» On Approximation Lower Bounds for TSP with Bounded Metrics
Sort
View
SODA
2010
ACM
238views Algorithms» more  SODA 2010»
15 years 11 months ago
How good is the Chord algorithm?
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjecti...
Constantinos Daskalakis, Ilias Diakonikolas, Mihal...
STOC
2012
ACM
209views Algorithms» more  STOC 2012»
13 years 4 months ago
Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
Anindya De, Ilias Diakonikolas, Vitaly Feldman, Ro...
CORR
2012
Springer
228views Education» more  CORR 2012»
13 years 9 months ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled
ALT
2006
Springer
15 years 11 months ago
How Many Query Superpositions Are Needed to Learn?
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...
Jorge Castro
UAI
1992
15 years 3 months ago
Interval Structure: A Framework for Representing Uncertain Information
In this paper, a unified framework for representing uncertain information based on the notion of an interval structure is proposed. It is shown that the lower and upper approximat...
S. K. Michael Wong, Lusheng Wang, Yiyu Yao