2168 search results - page 293 / 434 » Randomized Algorithms and Complexity Theory |
264
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
123
click to vote
DCC
2006
IEEE
16 years 3 months ago
2006
IEEE
Optimal index assignment of multiple description lattice vector quantizer (MDLVQ) can be posed as a large-scale linear assignment problem. But is this expensive algorithmic approa...
131
Voted
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
138
Voted
FOCS
2003
IEEE
15 years 8 months ago
2003
IEEE
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...
115
Voted
CIKM
2000
Springer
15 years 7 months ago
2000
Springer
RankBoost is a recently proposed algorithm for learning ranking functions. It is simple to implement and has strong justifications from computational learning theory. We describe...