Sciweavers

19320 search results - page 297 / 3864
» On the complexity of computing determinants
Sort
View
COMPGEOM
2008
ACM
15 years 8 months ago
Routing a maximum number of disks through a scene of moving obstacles
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
Joondong Kim, Joseph S. B. Mitchell, Valentin Poli...
190
Voted
ATAL
2010
Springer
15 years 7 months ago
Honor among thieves: collusion in multi-unit auctions
We consider collusion in multi-unit auctions where the allocation and payments are determined using the VCG mechanism. We show how collusion can increase the utility of the collud...
Yoram Bachrach
ISVD
2010
IEEE
15 years 5 months ago
Alpha Shape Topology of the Cosmic Web
—We study the topology of the Megaparsec Cosmic Web on the basis of the Alpha Shapes of the galaxy distribution. The simplicial complexes of the alpha shapes are used to determin...
Rien van de Weygaert, Erwin Platen, Gert Vegter, B...
GLOBECOM
2006
IEEE
16 years 22 days ago
On the Feasibility of Very Low Complexity Trust Modules Using PKPS Synergies
Abstract— For many evolving application scenarios like ubiquitous and autonomic computing systems, trustworthy computing solutions are essential. However the fact that the autono...
Mahalingam Ramkumar
ICRA
2002
IEEE
68views Robotics» more  ICRA 2002»
15 years 11 months ago
Self-Collision Detection and Prevention for Humanoid Robots
We present an efficient approach to self-collision detection suitable for complex articulated robots such as humanoids. Preventing self-collisions is vital for the safe operation ...
James J. Kuffner Jr., Koichi Nishiwaki, Satoshi Ka...