Sciweavers

223 search results - page 15 / 45
» Proving Termination by Bounded Increase
Sort
View
111
Voted
FOCS
2008
IEEE
15 years 2 months ago
Hardness of Nearest Neighbor under L-infinity
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...
Alexandr Andoni, Dorian Croitoru, Mihai Patrascu
119
Voted
MST
2010
78views more  MST 2010»
15 years 8 days ago
Sensitivity of Wardrop Equilibria
We study the sensitivity of equilibria in the well-known game theoretic traffic model due to Wardrop. We mostly consider single-commodity networks. Suppose, given a unit demand fl...
Matthias Englert, Thomas Franke, Lars Olbrich
109
Voted
IJCAI
1989
15 years 3 months ago
The Reason for the Benefits of Minimax Search
based on an abstract concept of quiescence. In the following we sketch this and a related model, describe the design of our experiments, and present the results of our simulation s...
Anton Scheucher, Hermann Kaindl
71
Voted
COMPGEOM
2009
ACM
15 years 8 months ago
Halving lines and measure concentration in the plane
Given a set of n points in the plane and a collection of k halving lines of P â„“1, . . . , â„“k indexed according to the increasing order of their slopes, we denote by d(â„“j, â„...
Rom Pinchasi
RTSS
2006
IEEE
15 years 7 months ago
Tightening the Bounds on Feasible Preemption Points
Caches have become invaluable for higher-end architectures to hide, in part, the increasing gap between processor speed and memory access times. While the effect of caches on timi...
Harini Ramaprasad, Frank Mueller