Sciweavers

6365 search results - page 303 / 1273
» Fast Local Computation Algorithms
Sort
View
DAGSTUHL
1997
15 years 8 months ago
Fast and Accurate Collision Detection for Virtual Environments
A realistic simulation system, which couples geometry and physics, can provide a useful toolkit for virtual environments. Interactions among moving objects in the virtual worlds a...
Ming C. Lin
SIAMREV
2010
140views more  SIAMREV 2010»
15 years 1 months ago
What Shape Is Your Conjugate? A Survey of Computational Convex Analysis and Its Applications
Computational Convex Analysis algorithms have been rediscovered several times in the past by researchers from different fields. To further communications between practitioners, we ...
Yves Lucet
PODC
2006
ACM
16 years 19 days ago
Local approximation schemes for topology control
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
Mirela Damian, Saurav Pandit, Sriram V. Pemmaraju
PPOPP
1993
ACM
15 years 10 months ago
LogP: Towards a Realistic Model of Parallel Computation
A vast body of theoretical research has focused either on overly simplistic models of parallel computation, notably the PRAM, or overly specific models that have few representati...
David E. Culler, Richard M. Karp, David A. Patters...
TALG
2008
100views more  TALG 2008»
15 years 6 months ago
Thin heaps, thick heaps
The Fibonacci heap was devised to provide an especially efficient implementation of Dijkstra's shortest path algorithm. Although asyptotically efficient, it is not as fast in...
Haim Kaplan, Robert Endre Tarjan