458 search results - page 79 / 92 » Totally magic graphs |
102
click to vote
CCCG
2008
15 years 1 months ago
2008
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...
100
click to vote
TOC
2008
14 years 11 months ago
2008
For an integer h 1, an elementary h-route flow is a flow along h edge disjoint paths between a source and a sink, each path carrying a unit of flow, and a single commodity h-rout...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
A sender wishes to broadcast a message of length n over an alphabet of size k to r users, where each user i, 1 i r should be able to receive one of possible mi messages. The cha...
125
click to vote
CVPR
2009
IEEE
16 years 6 months ago
2009
IEEE
Multiple view 3D video reconstruction of actor performance
captures a level-of-detail for body and clothing
movement which is time-consuming to produce using existing
animation ...
106
click to vote
STOC
2004
ACM
16 years 10 hour ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...