Sciweavers

417 search results - page 57 / 84
» Fast Methods for Solving Linear Diophantine Equations
Sort
View
ICML
2004
IEEE
14 years 9 months ago
A fast iterative algorithm for fisher discriminant using heterogeneous kernels
We propose a fast iterative classification algorithm for Kernel Fisher Discriminant (KFD) using heterogeneous kernel models. In contrast with the standard KFD that requires the us...
Glenn Fung, Murat Dundar, Jinbo Bi, R. Bharat Rao
ESA
2003
Springer
111views Algorithms» more  ESA 2003»
14 years 1 months ago
Fast Smallest-Enclosing-Ball Computation in High Dimensions
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
Kaspar Fischer, Bernd Gärtner, Martin Kutz
ICLP
1993
Springer
14 years 22 days ago
A Minimal Extension of the WAM for clp(FD)
nt an abstract instruction set for a constraint solver over finite domains, which can be smoothly integrated in the WAM architecture. It is based on the use of a single primitive...
Daniel Diaz, Philippe Codognet
NECO
2007
108views more  NECO 2007»
13 years 8 months ago
Spike-Frequency Adapting Neural Ensembles: Beyond Mean Adaptation and Renewal Theories
We propose a Markov process model for spike-frequency adapting neural ensembles which synthesizes existing mean-adaptation approaches, population density methods, and inhomogeneou...
Eilif Mueller, Lars Buesing, Johannes Schemmel, Ka...
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 8 months ago
Polynomial Filtering for Fast Convergence in Distributed Consensus
Abstract--In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods propose...
Effrosini Kokiopoulou, Pascal Frossard