Sciweavers

11231 search results - page 453 / 2247
» Digging for Data Structures
Sort
View
ICML
2008
IEEE
16 years 8 months ago
Hierarchical sampling for active learning
We present an active learning scheme that exploits cluster structure in data.
Sanjoy Dasgupta, Daniel Hsu
ICALP
2009
Springer
16 years 8 months ago
B-Treaps: A Uniquely Represented Alternative to B-Trees
We present the first uniquely represented data structure for an external memory model of computation, a B-tree analogue called a B-treap. Uniquely represented data structures repre...
Daniel Golovin
DIS
2009
Springer
16 years 2 months ago
The Two Faces of Active Learning
We present an active learning scheme that exploits cluster structure in data.
Sanjoy Dasgupta
ISDA
2008
IEEE
16 years 2 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
212
Voted
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