Sciweavers

934 search results - page 64 / 187
» A theoretical analysis of the HIFF problem
Sort
View
ICA
2007
Springer
15 years 4 months ago
Is the General Form of Renyi's Entropy a Contrast for Source Separation?
Abstract. Renyi’s entropy-based criterion has been proposed as an objective function for independent component analysis because of its relationship with Shannon’s entropy and i...
Frédéric Vrins, Dinh-Tuan Pham, Mich...
CN
2006
73views more  CN 2006»
14 years 10 months ago
Rate-distortion based link state update
Finding paths that satisfy the performance requirements of applications according to the link state information in a network is known as the quality-of-service (QoS) routing probl...
Gang Cheng, Nirwan Ansari
FOCS
2000
IEEE
15 years 2 months ago
On Clusterings - Good, Bad and Spectral
We motivate and develop a natural bicriteria measure for assessing the quality of a clustering that avoids the drawbacks of existing measures. A simple recursive heuristic is shown...
Ravi Kannan, Santosh Vempala, Adrian Vetta
TIT
2008
133views more  TIT 2008»
14 years 9 months ago
On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations
An underdetermined linear system of equations Ax = b with non-negativity constraint x 0 is considered. It is shown that for matrices A with a row-span intersecting the positive o...
Alfred M. Bruckstein, Michael Elad, Michael Zibule...
STACS
2004
Springer
15 years 3 months ago
Matching Algorithms Are Fast in Sparse Random Graphs
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hi...