Sciweavers

23 search results - page 4 / 5
» Parametric Duality and Kernelization: Lower Bounds and Upper...
Sort
View
COMPGEOM
2009
ACM
14 years 9 days 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
IJRR
2010
102views more  IJRR 2010»
13 years 4 months ago
Space-carving Kernels for Accurate Rough Terrain Estimation
Abstract— Accurate terrain estimation is critical for autonomous offroad navigation. Reconstruction of a 3D surface allows rough and hilly ground to be represented, yielding fast...
Raia Hadsell, J. Andrew Bagnell, Daniel F. Huber, ...
ALT
1999
Springer
13 years 10 months ago
Extended Stochastic Complexity and Minimax Relative Loss Analysis
We are concerned with the problem of sequential prediction using a givenhypothesis class of continuously-manyprediction strategies. An e ectiveperformance measure is the minimax re...
Kenji Yamanishi
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
13 years 10 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
RSA
2010
98views more  RSA 2010»
13 years 4 months ago
Merging percolation on Zd and classical random graphs: Phase transition
: We study a random graph model which is a superposition of bond percolation on Zd with parameter p, and a classical random graph G(n, c/n). We show that this model, being a homoge...
Tatyana S. Turova, Thomas Vallier