Sciweavers

545 search results - page 93 / 109
» Estimating the Probability of Approximate Matches
Sort
View
UAI
2003
15 years 2 months ago
Learning Generative Models of Similarity Matrices
Recently, spectral clustering (a.k.a. normalized graph cut) techniques have become popular for their potential ability at finding irregularlyshaped clusters in data. The input to...
Rómer Rosales, Brendan J. Frey
136
Voted
IJON
2006
131views more  IJON 2006»
15 years 18 days ago
Optimizing blind source separation with guided genetic algorithms
This paper proposes a novel method for blindly separating unobservable independent component (IC) signals based on the use of a genetic algorithm. It is intended for its applicati...
J. M. Górriz, Carlos García Puntonet...
103
Voted
JMLR
2008
110views more  JMLR 2008»
15 years 18 days ago
Cross-Validation Optimization for Large Scale Structured Classification Kernel Methods
We propose a highly efficient framework for penalized likelihood kernel methods applied to multiclass models with a large, structured set of classes. As opposed to many previous a...
Matthias W. Seeger
94
Voted
TSP
2008
167views more  TSP 2008»
15 years 15 days ago
Decentralized Adaptive Filtering Algorithms for Sensor Activation in an Unattended Ground Sensor Network
Abstract--We present decentralized adaptive filtering algorithms for sensor activation control in an unattended ground sensor network (UGSN) comprised of ZigBee-enabled nodes. Node...
Vikram Krishnamurthy, Michael Maskery, Gang George...
JAIR
1998
198views more  JAIR 1998»
15 years 9 days ago
Probabilistic Inference from Arbitrary Uncertainty using Mixtures of Factorized Generalized Gaussians
This paper presents a general and efficient framework for probabilistic inference and learning from arbitrary uncertain information. It exploits the calculation properties of fini...
Alberto Ruiz, Pedro E. López-de-Teruel, M. ...