16404 search results - page 328 / 3281 » A set coverage problem |
155
click to vote
ICRA
2005
IEEE
16 years 6 days ago
2005
IEEE
— The paper considers the problem of setting the dimensions of a system of constrained parallel robots to ensure that together they can position an end-effector in a specified s...
179
click to vote
VLDB
2005
ACM
16 years 2 days ago
2005
ACM
A major challenge in frequent-pattern mining is the sheer size of its mining results. In many cases, a high min sup threshold may discover only commonsense patterns but a low one ...
221
Voted
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
164
click to vote
CODES
1998
IEEE
15 years 11 months ago
1998
IEEE
Timing analysis for checking satisfaction of constraints is a crucial problem in real-time system design. In some current approaches, the delay of software modules is precalculate...
200
click to vote
SGP
2007
15 years 9 months ago
2007
We introduce an algorithm for reconstructing watertight surfaces from unoriented point sets. Using the Voronoi diagram of the input point set, we deduce a tensor field whose princ...