ESA
2001
Springer
14 years 4 months ago
2001
Springer
Computing the Delaunay triangulation of n points requires usually a minimum of (n log n) operations, but in some special cases where some additional knowledge is provided, faster a...
ESA
2001
Springer
14 years 4 months ago
2001
Springer
Real algebraic expressions are expressions whose leaves are integers and whose internal nodes are additions, subtractions, multiplications, divisions, k-th root operations for int...
ESA
2001
Springer
14 years 4 months ago
2001
Springer
Motivated by questions in location planning, we show for a set of colored point sites in the plane how to compute the smallest— by perimeter or area—axis-parallel rectangle and...
EMMCVPR
2001
Springer
14 years 4 months ago
2001
Springer
Recent work (Yedidia, Freeman, Weiss [22]) has shown that stable points of belief propagation (BP) algorithms [12] for graphs with loops correspond to extrema of the Bethe free ene...
CSCWD
2001
Springer
14 years 4 months ago
2001
Springer
The authors have developed a new approach to database interoperability using the sketch data model. That technique has now been used in a number of applications, but an important ...
COLT
2001
Springer
14 years 4 months ago
2001
Springer
In this paper we study a paradigm to generalize online classification algorithms for binary classification problems to multiclass problems. The particular hypotheses we investig...
COLT
2001
Springer
14 years 4 months ago
2001
Springer
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...
COCO
2001
Springer
14 years 4 months ago
2001
Springer
COCO
2001
Springer
14 years 4 months ago
2001
Springer
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
COCO
2001
Springer
14 years 4 months ago
2001
Springer
We use hypotheses of structural complexity theory to separate various NP-completeness notions. In particular, we introduce an hypothesis from which we describe a set in NP that is...