Sciweavers

11784 search results - page 551 / 2357
» Interpolation for data structures
Sort
View
ISDA
2008
IEEE
16 years 1 months ago
Compute the Term Contributed Frequency
In this paper, we propose an algorithm and data structure for computing the term contributed frequency (tcf) for all N-grams in a text corpus. Although term frequency is one of th...
Cheng-Lung Sung, Hsu-Chun Yen, Wen-Lian Hsu
ISVC
2007
Springer
16 years 1 months ago
Fast kd -Tree Construction for 3D-Rendering Algorithms Like Ray Tracing
Many computer graphics rendering algorithms and techniques use ray tracing for generation of natural and photo-realistic images. The efficiency of the ray tracing algorithms depend...
Sajid Hussain, Håkan Grahn
WEA
2007
Springer
104views Algorithms» more  WEA 2007»
16 years 1 months ago
Dynamic Trees in Practice
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
Robert Endre Tarjan, Renato Fonseca F. Werneck
SP
1998
IEEE
15 years 11 months ago
Stack and Queue Integrity on Hostile Platforms
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...
Premkumar T. Devanbu, Stuart G. Stubblebine
AUSAI
2006
Springer
15 years 10 months ago
Learning Hybrid Bayesian Networks by MML
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...
Rodney T. O'Donnell, Lloyd Allison, Kevin B. Korb