Sciweavers

1702 search results - page 38 / 341
» Using Nondeterminism to Design Efficient Deterministic Algor...
Sort
View
STOC
2005
ACM
164views Algorithms» more  STOC 2005»
14 years 8 months ago
Cooperative asynchronous update of shared memory
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Bogdan S. Chlebus, Dariusz R. Kowalski
3DPVT
2006
IEEE
147views Visualization» more  3DPVT 2006»
14 years 1 months ago
Efficient Constraint Evaluation Algorithms for Hierarchical Next-Best-View Planning
We recently proposed a new and efficient next-bestview algorithm for 3D reconstruction of indoor scenes using active range sensing. We overcome the computation difficulty of evalu...
Kok-Lim Low, Anselmo Lastra
SIGMOD
2005
ACM
162views Database» more  SIGMOD 2005»
14 years 7 months ago
Fast and Approximate Stream Mining of Quantiles and Frequencies Using Graphics Processors
We present algorithms for fast quantile and frequency estimation in large data streams using graphics processor units (GPUs). We exploit the high computational power and memory ba...
Naga K. Govindaraju, Nikunj Raghuvanshi, Dinesh Ma...
GLOBECOM
2007
IEEE
13 years 11 months ago
Efficient Self Protection Algorithms for Static Wireless Sensor Networks
Wireless sensor networks have been widely used in many surveillance applications. Due to the importance of sensor nodes in such applications, certain level of protection needs to b...
Yu Wang 0003, Xiang-Yang Li, Qian Zhang
INFOCOM
2010
IEEE
13 years 6 months ago
Delay-Based Network Utility Maximization
—It is well known that max-weight policies based on a queue backlog index can be used to stabilize stochastic networks, and that similar stability results hold if a delay index i...
Michael J. Neely