Sciweavers

2168 search results - page 240 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
150
Voted
COMPGEOM
2009
ACM
15 years 11 months ago
Coresets for polytope distance
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
Bernd Gärtner, Martin Jaggi
JMLR
2008
129views more  JMLR 2008»
15 years 4 months ago
Finite-Time Bounds for Fitted Value Iteration
In this paper we develop a theoretical analysis of the performance of sampling-based fitted value iteration (FVI) to solve infinite state-space, discounted-reward Markovian decisi...
Rémi Munos, Csaba Szepesvári
IWVF
2001
Springer
15 years 9 months ago
The Shock Scaffold for Representing 3D Shape
The usefulness of the 3D Medial Axis (MA) is dependent on both the availability of accurate and stable methods for computing individual MA points and on schemes for deriving the l...
Frederic F. Leymarie, Benjamin B. Kimia
MOBICOM
2004
ACM
15 years 10 months ago
Broadcast reception rates and effects of priority access in 802.11-based vehicular ad-hoc networks
One key usage of VANET is to support vehicle safety applications. This use case is characterized by the prominence of broadcasts in scaled settings. In this context, we try to ans...
Marc Torrent-Moreno, Daniel Jiang, Hannes Hartenst...
INFOCOM
2010
IEEE
15 years 3 months ago
Limitations and Possibilities of Path Trading between Autonomous Systems
Abstract—When forwarding packets in the Internet, Autonomous Systems (ASes) frequently choose the shortest path in their network to the next-hop AS in the BGP path, a strategy kn...
Yuval Shavitt, Yaron Singer