Sciweavers

339 search results - page 61 / 68
» Is the Euclidean algorithm optimal among its peers
Sort
View
NECO
2011
13 years 2 months ago
Least-Squares Independent Component Analysis
Accurately evaluating statistical independence among random variables is a key element of Independent Component Analysis (ICA). In this paper, we employ a squared-loss variant of ...
Taiji Suzuki, Masashi Sugiyama
JACM
2011
152views more  JACM 2011»
12 years 10 months ago
Robust principal component analysis?
This paper is about a curious phenomenon. Suppose we have a data matrix, which is the superposition of a low-rank component and a sparse component. Can we recover each component i...
Emmanuel J. Candès, Xiaodong Li, Yi Ma, Joh...
CDC
2009
IEEE
208views Control Systems» more  CDC 2009»
13 years 8 months ago
Sensor selection for hypothesis testing in wireless sensor networks: a Kullback-Leibler based approach
We consider the problem of selecting a subset of p out of n sensors for the purpose of event detection, in a wireless sensor network (WSN). Occurrence or not of the event of intere...
Dragana Bajovic, Bruno Sinopoli, João Xavie...
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
14 years 7 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
IWCMC
2010
ACM
14 years 17 days ago
Energy-aware online routing with QoS constraints in multi-rate wireless ad hoc networks
Wireless ad hoc networks consist of hundreds to thousands of mobile nodes that are powered by batteries. To prolong the network operational time, energy conservation in such netwo...
Wei Yang, Weifa Liang, Jun Luo, Wenhua Dou