Sciweavers

921 search results - page 141 / 185
» Expressing Computational Complexity in Constructive Type The...
Sort
View
PODC
2009
ACM
14 years 8 months ago
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
Riko Jacob, Andréa W. Richa, Christian Sche...
STACS
2007
Springer
14 years 2 months ago
The Polynomially Bounded Perfect Matching Problem Is in NC 2
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
Manindra Agrawal, Thanh Minh Hoang, Thomas Thierau...
PPOPP
2005
ACM
14 years 1 months ago
A linear-time algorithm for optimal barrier placement
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
Alain Darte, Robert Schreiber
TVCG
2010
129views more  TVCG 2010»
13 years 6 months ago
Projector Placement Planning for High Quality Visualizations on Real-World Colored Objects
—Many visualization applications benefit from displaying content on real-world objects rather than on a traditional display (e.g., a monitor). This type of visualization display ...
Alvin J. Law, Daniel G. Aliaga, Aditi Majumder
ICRA
2009
IEEE
259views Robotics» more  ICRA 2009»
14 years 2 months ago
Fast Point Feature Histograms (FPFH) for 3D registration
— In our recent work [1], [2], we proposed Point Feature Histograms (PFH) as robust multi-dimensional features which describe the local geometry around a point p for 3D point clo...
Radu Bogdan Rusu, Nico Blodow, Michael Beetz