274 search results - page 39 / 55 » On Random Sampling over Joins |
149
click to vote
IJRR
2011
14 years 8 months ago
2011
— In this paper we develop an RRT-based motion planner that achieved bounding in simulation with the LittleDog robot over extremely rough terrain. LittleDog is a quadruped robot ...
115
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
118
click to vote
P2P
2005
IEEE
15 years 7 months ago
2005
IEEE
Structured peer-to-peer overlay networks are now an established paradigm for implementing a wide range of distributed services. While the problem of maintaining these networks in ...
153
click to vote
COMPGEOM
1992
ACM
15 years 6 months ago
1992
ACM
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
105
click to vote
IS
2010
15 years 9 days ago
2010
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...