Sciweavers

2570 search results - page 143 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
CMPB
2010
152views more  CMPB 2010»
15 years 3 months ago
Fast free-form deformation using graphics processing units
A large number of algorithms have been developed to perform non-rigid registration and it is a tool commonly used in medical image analysis. The FreeForm Deformation algorithm is ...
Marc Modat, Gerard R. Ridgway, Zeike A. Taylor, Ma...
145
Voted
ICML
2007
IEEE
16 years 4 months ago
A fast linear separability test by projection of positive points on subspaces
A geometric and non parametric procedure for testing if two nite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that deter...
A. P. Yogananda, M. Narasimha Murty, Lakshmi Gopal
130
Voted
SPAA
2005
ACM
15 years 9 months ago
Fast construction of overlay networks
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu...
ICML
2005
IEEE
16 years 4 months ago
Fast condensed nearest neighbor rule
We present a novel algorithm for computing a training set consistent subset for the nearest neighbor decision rule. The algorithm, called FCNN rule, has some desirable properties....
Fabrizio Angiulli
126
Voted
VLSID
2002
IEEE
107views VLSI» more  VLSID 2002»
16 years 3 months ago
Automatic Model Refinement for Fast Architecture Exploration
We present a methodology and algorithms for automatic refinement from a given design specification to an architecture model based on decisions in architecture exploration. An arch...
Junyu Peng, Samar Abdi, Daniel Gajski