Sciweavers

1731 search results - page 81 / 347
» Maximum likelihood analysis of algorithms and data structure...
Sort
View
IBPRIA
2003
Springer
15 years 9 months ago
Does Independent Component Analysis Play a~Role in Unmixing Hyperspectral Data?
—Independent component analysis (ICA) has recently been proposed as a tool to unmix hyperspectral data. ICA is founded on two assumptions: 1) the observed spectrum vector is a li...
José M. P. Nascimento, José M. B. Di...
TSP
2010
14 years 10 months ago
Independent component analysis by entropy bound minimization
A novel (differential) entropy estimator is introduced where the maximum entropy bound is used to approximate the entropy given the observations, and is computed using a numerical ...
Xi-Lin Li, Tülay Adali
CVPR
2007
IEEE
16 years 6 months ago
Robust Click-Point Linking: Matching Visually Dissimilar Local Regions
This paper presents robust click-point linking: a novel localized registration framework that allows users to interactively prescribe where the accuracy has to be high. By emphasi...
Kazunori Okada, Xiaolei Huang
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
15 years 9 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
COMPGEOM
2010
ACM
15 years 9 months ago
A kinetic triangulation scheme for moving points in the plane
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
Haim Kaplan, Natan Rubin, Micha Sharir