Sciweavers

1434 search results - page 203 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
HIPC
2005
Springer
14 years 3 months ago
Performance Study of LU Decomposition on the Programmable GPU
With the increasing programmability of GPUs (graphics processing units), these units are emerging as an attractive computing platform not only for traditional graphics computation ...
Fumihiko Ino, Manabu Matsui, Keigo Goda, Kenichi H...
ECCV
2002
Springer
14 years 11 months ago
Hyperdynamics Importance Sampling
Sequential random sampling (`Markov Chain Monte-Carlo') is a popular strategy for many vision problems involving multimodal distributions over high-dimensional parameter spac...
Cristian Sminchisescu, Bill Triggs
PODC
2009
ACM
14 years 10 months ago
Coloring unstructured wireless multi-hop networks
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
Johannes Schneider, Roger Wattenhofer
IEEEPACT
2006
IEEE
14 years 3 months ago
A low-cost memory remapping scheme for address bus protection
The address sequence on the processor-memory bus can reveal abundant information about the control flow of a program. This can lead to critical information leakage such as encryp...
Lan Gao, Jun Yang 0002, Marek Chrobak, Youtao Zhan...
ICNP
1997
IEEE
14 years 1 months ago
Balanced Routing
Future computer networks are expected to carry bursty traffic. Shortest -path routing protocols such as OSPF and RIP have t he disadvantage of causing bottlenecks due to their inh...
Jorge Arturo Cobb, Mohamed G. Gouda