Sciweavers

119 search results - page 15 / 24
» A relaxed approach to combinatorial problems in robustness a...
Sort
View
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
14 years 2 months ago
A graph-theoretic approach to extract storylines from search results
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
Ravi Kumar, Uma Mahadevan, D. Sivakumar
CEC
2007
IEEE
14 years 3 months ago
Memetic algorithms for inexact graph matching
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
Thomas Bärecke, Marcin Detyniecki
ICCV
2005
IEEE
14 years 2 months ago
KALMANSAC: Robust Filtering by Consensus
We propose an algorithm to perform causal inference of the state of a dynamical model when the measurements are corrupted by outliers. While the optimal (maximumlikelihood) soluti...
Andrea Vedaldi, Hailin Jin, Paolo Favaro, Stefano ...
MICCAI
2009
Springer
14 years 10 months ago
Enforcing Monotonic Temporal Evolution in Dry Eye Images
We address the problem of identifying dry areas in the tear film as part of a diagnostic tool for dry-eye syndrome. The requirement is to identify and measure the growth of the dry...
Tamir Yedidya, Peter Carr, Richard Hartley, Jea...
GECCO
1999
Springer
100views Optimization» more  GECCO 1999»
14 years 1 months ago
Plasma X-ray Spectra Analysis Using Genetic Algorithms
X-ray spectroscopic analysis is a powerful tool for plasma diagnostics. We use genetic algorithms to automatically analyze experimental X-ray line spectra and discuss a particular...
Igor E. Golovkin, Roberto C. Mancini, Sushil J. Lo...