Sciweavers

450 search results - page 56 / 90
» Estimating Search Tree Size
Sort
View
DMIN
2007
158views Data Mining» more  DMIN 2007»
13 years 10 months ago
Mining Frequent Itemsets Using Re-Usable Data Structure
- Several algorithms have been introduced for mining frequent itemsets. The recent datasettransformation approach suffers either from the possible increasing in the number of struc...
Mohamed Yakout, Alaaeldin M. Hafez, Hussein Aly
VMV
2001
132views Visualization» more  VMV 2001»
13 years 10 months ago
Optimal Memory Constrained Isosurface Extraction
Efficient isosurface extraction from large volume data sets requires special algorithms and data structures. Such algorithms typically either use a hierarchical spatial subdivisio...
Dietmar Saupe, Jürgen Toelke
JAIR
2011
187views more  JAIR 2011»
13 years 3 months ago
A Monte-Carlo AIXI Approximation
This paper describes a computationally feasible approximation to the AIXI agent, a universal reinforcement learning agent for arbitrary environments. AIXI is scaled down in two ke...
Joel Veness, Kee Siong Ng, Marcus Hutter, William ...
CVPR
2012
IEEE
11 years 11 months ago
Computing nearest-neighbor fields via Propagation-Assisted KD-Trees
Matching patches between two images, also known as computing nearest-neighbor fields, has been proven a useful technique in various computer vision/graphics algorithms. But this ...
Kaiming He, Jian Sun
SC
2000
ACM
14 years 1 months ago
Parallel Phylogenetic Inference
Recent advances in DNA sequencing technology have created large data sets upon which phylogenetic inference can be performed. However, current research is limited by the prohibiti...
Quinn Snell, Michael Whiting, Mark J. Clement, Dav...