5169 search results - page 242 / 1034 » Locality approximation using time |
179
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These noti...
168
Voted
COCOON
2010
Springer
15 years 11 months ago
2010
Springer
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
175
click to vote
TIT
2010
15 years 1 months ago
2010
We consider the problem of rate and power allocation in a multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a general concave ut...
165
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
In this paper we present a method for computing the localization of a mobile robot with reference to a learning video sequence. The robot is first guided on a path by a human, whi...
155
click to vote
ICRA
2006
IEEE
16 years 19 days ago
2006
IEEE
Abstract— We present a path planning algorithm for a polyhedral robot with six degrees of freedom (6DOF) and a static obstacle. The planner consists of a dual-tree RRT algorithm ...