Sciweavers

176 search results - page 35 / 36
» Optimal Sampling Strategies in Quicksort
Sort
View
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
14 years 11 months ago
Learning Markov Network Structure using Few Independence Tests
In this paper we present the Dynamic Grow-Shrink Inference-based Markov network learning algorithm (abbreviated DGSIMN), which improves on GSIMN, the state-ofthe-art algorithm for...
Parichey Gandhi, Facundo Bromberg, Dimitris Margar...
113
Voted
IJCV
1998
233views more  IJCV 1998»
14 years 9 months ago
A Level-Set Approach to 3D Reconstruction from Range Data
This paper presents a method that uses the level sets of volumes to reconstruct the shapes of 3D objects from range data. The strategy is to formulate 3D reconstruction as a stati...
Ross T. Whitaker
IPMI
2005
Springer
15 years 10 months ago
Spherical Navigator Registration Using Harmonic Analysis for Prospective Motion Correction
Spherical navigators are an attractive approach to motion compensation in Magnetic Resonance Imaging. Because they can be acquired quickly, spherical navigators have the potential ...
Christopher L. Wyatt, Narter Ari, Robert A. Kraft
PEWASUN
2008
ACM
14 years 11 months ago
Experimentation and performance evaluation of rate adaptation algorithms in wireless mesh networks
In this paper we present an experimental study conducted in 802.11based mesh networks of three existing rate adaptation algorithms. The aim of this study is twofold. On the one ha...
Emilio Ancillotti, Raffaele Bruno, Marco Conti
88
Voted
BMCBI
2008
122views more  BMCBI 2008»
14 years 9 months ago
A practical comparison of two K-Means clustering algorithms
Background: Data clustering is a powerful technique for identifying data with similar characteristics, such as genes with similar expression patterns. However, not all implementat...
Gregory A. Wilkin, Xiuzhen Huang