Sciweavers

1646 search results - page 42 / 330
» fast 2007
Sort
View
76
Voted
NIPS
1993
15 years 2 months ago
Fast Pruning Using Principal Components
We present a new algorithm for eliminating excess parameters and improving network generalization after supervised training. The method, \Principal Components Pruning (PCP)",...
Asriel U. Levin, Todd K. Leen, John E. Moody
94
Voted
AUTOMATICA
2007
80views more  AUTOMATICA 2007»
15 years 26 days ago
Fast, large-scale model predictive control by partial enumeration
Partial enumeration (PE) is presented as a method for treating large, linear model predictive control applications that are out of reach with available MPC methods. PE uses both a...
Gabriele Pannocchia, James B. Rawlings, Stephen J....
BMCBI
2006
86views more  BMCBI 2006»
15 years 24 days ago
PHY*FI: fast and easy online creation and manipulation of phylogeny color figures
nd: The need to depict a phylogeny, or some other kind of abstract tree, is very frequently experienced by researchers from a broad range of biological and computational disciplin...
Jakob Fredslund
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
15 years 20 days ago
How Fast Is the k-Means Method?
We present polynomial upper and lower bounds on the number of iterations performed by the k-means method (a.k.a. Lloyd's method) for k-means clustering. Our upper bounds are ...
Sariel Har-Peled, Bardia Sadri
107
Voted
JCIT
2007
100views more  JCIT 2007»
15 years 19 days ago
Frame Sliced Parallel Signature Files for Fast Colored Image Retrieval
The paper presents a novel approach for searching a very large image database employing frame sliced parallel signature file. Signature files have been proposed and used for retri...
Shashikala Tapaswi