Sciweavers

1257 search results - page 230 / 252
» A generalization of Euler's constant
Sort
View
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
13 years 12 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
SIGGRAPH
1999
ACM
13 years 12 months ago
Six Degree-of-Freedom Haptic Rendering Using Voxel Sampling
A simple, fast, and approximate voxel-based approach to 6DOF haptic rendering is presented. It can reliably sustain a 1000 Hz haptic refresh rate without resorting to asynchronous...
William A. McNeely, Kevin D. Puterbaugh, James J. ...
INFOCOM
1999
IEEE
13 years 12 months ago
Ring versus Tree Embedding for Real-time Group Multicast
In general topology networks, routing from one node to another over a tree embedded in the network is intuitively a good strategy, since it typically results in a route length of O...
Mario Baldi, Yoram Ofek
CONTEXT
1999
Springer
13 years 12 months ago
The Pragmatic Roots of Context
When modelling complex systems one can not include all the causal factors, but one has to settle for partial models. This is alright if the factors left out are either so constant...
Bruce Edmonds
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
13 years 11 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill