4536 search results - page 403 / 908 » Contention-Sensitive Data Structures and Algorithms |
216
Voted
SOSP
2007
ACM
16 years 3 months ago
2007
ACM
We propose a new paradigm for building scalable distributed systems. Our approach does not require dealing with message-passing protocols—a major complication in existing distri...
226
click to vote
KDD
2004
ACM
16 years 7 days ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
189
Voted
VISUALIZATION
1998
IEEE
15 years 11 months ago
1998
IEEE
In this paper, we present a novel out-of-core technique for the interactive computation of isosurfaces from volume data. Our algorithm minimizes the main memory and disk space req...
236
click to vote
SOFTVIS
2010
ACM
15 years 7 months ago
2010
ACM
Understanding the data structures in a program is crucial to understanding how the program works, or why it doesn't work. Inspecting the code that implements the data structu...
185
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
We propose Laplace max-margin Markov networks (LapM3 N), and a general class of Bayesian M3 N (BM3 N) of which the LapM3 N is a special case with sparse structural bias, for robus...