Sciweavers

219 search results - page 33 / 44
» Fast Algorithms for Finding Extremal Sets
Sort
View
PR
2010
135views more  PR 2010»
13 years 2 months ago
Revisiting priority queues for image analysis
Many algorithms in image analysis require a priority queue, a data structure that holds pointers to pixels in the image, and which allows efficiently finding the pixel in the queu...
Cris L. Luengo Hendriks
BMCBI
2008
171views more  BMCBI 2008»
13 years 7 months ago
A general approach to simultaneous model fitting and variable elimination in response models for biological data with many more
Background: With the advent of high throughput biotechnology data acquisition platforms such as micro arrays, SNP chips and mass spectrometers, data sets with many more variables ...
Harri T. Kiiveri
MICCAI
2008
Springer
14 years 8 months ago
Discovering Modes of an Image Population through Mixture Modeling
Abstract. We present iCluster, a fast and efficient algorithm that clusters a set of images while co-registering them using a parameterized, nonlinear transformation model. The out...
Mert R. Sabuncu, Serdar K. Balci, Polina Golland
CGF
2000
155views more  CGF 2000»
13 years 7 months ago
Surface Reconstruction Based on Lower Dimensional Localized Delaunay Triangulation
We present a fast, memory efficient algorithm that generates a manifold triangular mesh S passing through a set of unorganized points P R3 . Nothing is assumed about the geometry,...
M. Gopi, Shankar Krishnan, Cláudio T. Silva
IJCAI
2001
13 years 9 months ago
Reinforcement Learning in Distributed Domains: Beyond Team Games
Using a distributed algorithm rather than a centralized one can be extremely beneficial in large search problems. In addition, the incorporation of machine learning techniques lik...
David Wolpert, Joseph Sill, Kagan Tumer