Sciweavers

350 search results - page 65 / 70
» Approximation Algorithms for Unique Games
Sort
View
APVIS
2006
13 years 9 months ago
Mesh simplification using ellipsoidal schema for isotropic quantization of face-normal vectors
In this paper, we present a method for simplification of arbitrary 3D meshes that is based on Isotropic Quantization of face-normal vectors. There are three stages. Firstly, a cod...
Ganesan Subramaniam, Kenneth Ong
CORR
2011
Springer
209views Education» more  CORR 2011»
12 years 11 months ago
Analysis and Improvement of Low Rank Representation for Subspace segmentation
We analyze and improve low rank representation (LRR), the state-of-the-art algorithm for subspace segmentation of data. We prove that for the noiseless case, the optimization mode...
Siming Wei, Zhouchen Lin
ATAL
2010
Springer
13 years 8 months ago
On the limits of dictatorial classification
In the strategyproof classification setting, a set of labeled examples is partitioned among multiple agents. Given the reported labels, an optimal classification mechanism returns...
Reshef Meir, Ariel D. Procaccia, Jeffrey S. Rosens...
IJCAI
2007
13 years 9 months ago
Utile Distinctions for Relational Reinforcement Learning
We introduce an approach to autonomously creating state space abstractions for an online reinforcement learning agent using a relational representation. Our approach uses a tree-b...
William Dabney, Amy McGovern
IJRR
2008
115views more  IJRR 2008»
13 years 7 months ago
Planning High-quality Paths and Corridors Amidst Obstacles
The motion-planning problem, involving the computation of a collision-free path for a moving entity amidst obstacles, is a central problem in fields like Robotics and Game Design....
Ron Wein, Jur P. van den Berg, Dan Halperin