Sciweavers

1578 search results - page 260 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
POPL
2010
ACM
14 years 7 months ago
Compositional May-Must Program Analysis: Unleashing the Power of Alternation
Program analysis tools typically compute two types of information: (1) may information that is true of all program executions and is used to prove the absence of bugs in the progr...
Aditya V. Nori, Patrice Godefroid, SaiDeep Tetali,...
IROS
2009
IEEE
138views Robotics» more  IROS 2009»
14 years 4 months ago
Using eigenposes for lossless periodic human motion imitation
— Programming a humanoid robot to perform an action that takes the robot’s complex dynamics into account is a challenging problem. Traditional approaches typically require high...
Rawichote Chalodhorn, Rajesh P. N. Rao
CGF
2011
13 years 1 months ago
Global Structure Optimization of Quadrilateral Meshes
We introduce a fully automatic algorithm which optimizes the high-level structure of a given quadrilateral mesh to achieve a coarser quadrangular base complex. Such a topological ...
David Bommes, Timm Lempfer, Leif Kobbelt
PODS
2008
ACM
170views Database» more  PODS 2008»
14 years 10 months ago
Answering aggregate queries in data exchange
Data exchange, also known as data translation, has been extensively investigated in recent years. One main direction of research has focused on the semantics and the complexity of...
Foto N. Afrati, Phokion G. Kolaitis
SPAA
2005
ACM
14 years 3 months ago
Fast construction of overlay networks
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu...