11231 search results - page 454 / 2247 » Digging for Data Structures |
195
click to vote
WEA
2007
Springer
16 years 1 months ago
2007
Springer
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
175
click to vote
SP
1998
IEEE
15 years 12 months ago
1998
IEEE
When computationally intensive tasks have to be carried out on trusted, but limited, platforms such as smart cards, it becomes necessary to compensate for the limited resources me...
217
click to vote
AUSAI
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. We use a Markov Chain Monte Carlo (MCMC) MML algorithm to learn hybrid Bayesian networks from observational data. Hybrid networks represent local structure, using conditi...
206
click to vote
FPCA
1995
15 years 11 months ago
1995
In functional programming, intermediate data structures are often used to “glue’) together small programs. Deforestation is a program transformation to remove these intermedia...
225
click to vote
ECCV
2010
Springer
15 years 10 months ago
2010
Springer
Confronted with the high-dimensional tensor-like visual data, we derive a method for the decomposition of an observed tensor into a low-dimensional structure plus unbounded but spa...