4541 search results - page 388 / 909 » Cache-Oblivious Algorithms and Data Structures |
144
click to vote
VISUALIZATION
1998
IEEE
15 years 9 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...
177
click to vote
SOFTVIS
2010
ACM
15 years 5 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...
131
click to vote
IJCAI
1997
15 years 6 months ago
1997
In this paper, we concentrate on the expressive power of hierarchical structures in neural networks. Recently, the so-called SplitNet model was introduced. It develops a dynamic n...
133
click to vote
ICML
2008
IEEE
16 years 5 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...
130
click to vote
WADS
1989
Springer
15 years 8 months ago
1989
Springer
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...