5653 search results - page 785 / 1131 » Distributed Conceptual Structures |
150
click to vote
SPAA
2004
ACM
16 years 5 days ago
2004
ACM
Despite years of research, the design of efficient nonblocking algorithms remains difficult. A key reason is that current shared-memory multiprocessor architectures support only s...
188
click to vote
APPROX
2004
Springer
16 years 4 days ago
2004
Springer
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
182
click to vote
CAAN
2004
Springer
16 years 4 days ago
2004
Springer
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have ...
185
click to vote
ECCV
2004
Springer
16 years 4 days ago
2004
Springer
Stochastic tracking of structured models in monolithic state spaces often requires modeling complex distributions that are difficult to represent with either parametric or sample...
186
click to vote
EGPGV
2004
Springer
16 years 4 days ago
2004
Springer
This paper presents a new interactive parallel method for direct visualization of large particle datasets. Based on a parallel rendering cluster, a frame rate of 9 frames-per-seco...