Sciweavers

75 search results - page 4 / 15
» Independent component analysis by entropy bound minimization
Sort
View
SDM
2009
SIAM
130views Data Mining» more  SDM 2009»
15 years 6 months ago
FuncICA for Time Series Pattern Discovery.
We introduce FuncICA, a new independent component analysis method for pattern discovery in inherently functional data, such as time series data. FuncICA can be considered an analo...
Alexander Gray, Nishant Mehta
CVPR
2011
IEEE
14 years 1 months ago
Entropy Rate Superpixel Segmentation
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
Ming-Yu Liu, Oncel Tuzel, Srikumar Ramalingam, Ram...
TIT
2002
72views more  TIT 2002»
14 years 9 months ago
Principal curves with bounded turn
Principal curves, like principal components, are a tool used in multivariate analysis for ends like feature extraction. Defined in their original form, principal curves need not ex...
S. Sandilya, Sanjeev R. Kulkarni
FOCS
2007
IEEE
15 years 3 months ago
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
Jonathan A. Kelner, Evdokia Nikolova
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
14 years 11 months ago
Why simple hash functions work: exploiting the entropy in a data stream
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
Michael Mitzenmacher, Salil P. Vadhan