Sciweavers

2374 search results - page 395 / 475
» Fast Distributed Algorithms for Computing Separable Function...
Sort
View
TSMC
2010
14 years 4 months ago
Distance Approximating Dimension Reduction of Riemannian Manifolds
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
Changyou Chen, Junping Zhang, Rudolf Fleischer
DC
2010
14 years 10 months ago
Refined quorum systems
It is considered good distributed computing practice to devise object implementations that tolerate contention, periods of asynchrony and a large number of failures, but perform f...
Rachid Guerraoui, Marko Vukolic

Publication
331views
16 years 9 months ago
On Accurate and Efficient Statistical Counting in Sensor-Based Surveillance Systems
Sensor networks have been used in many surveillance systems, providing statistical information about monitored areas. Accurate counting information (e.g., the distribution of the ...
Shuo Guo, Tian He, Mohamed F. Mokbel, John A. Stan...
73
Voted
PG
2007
IEEE
15 years 4 months ago
Precomputed Visibility Cuts for Interactive Relighting with Dynamic BRDFs
This paper presents a novel PRT-based method that uses precomputed visibility cuts for interactive relighting with all-frequency environment maps and arbitrary dynamic BRDFs. Our ...
Oskar Åkerlund, Mattias Unger, Rui Wang
ICRA
2010
IEEE
154views Robotics» more  ICRA 2010»
14 years 8 months ago
Multi-agent path planning with multiple tasks and distance constraints
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...
Subhrajit Bhattacharya, Maxim Likhachev, Vijay Kum...