Sciweavers

244 search results - page 46 / 49
» Compressive PCA on Graphs
Sort
View
ICASSP
2009
IEEE
13 years 7 months ago
On the recovery of nonnegative sparse vectors from sparse measurements inspired by expanders
This paper studies compressed sensing for the recovery of non-negative sparse vectors from a smaller number of measurements than the ambient dimension of the unknown vector. We fo...
M. Amin Khajehnejad, Babak Hassibi
IEEESCC
2009
IEEE
13 years 7 months ago
Theoretical Framework for Eliminating Redundancy in Workflows
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
Dhrubajyoti Saha, Abhishek Samanta, Smruti R. Sara...
JMLR
2010
134views more  JMLR 2010»
13 years 4 months ago
Inference of Graphical Causal Models: Representing the Meaningful Information of Probability Distributions
This paper studies the feasibility and interpretation of learning the causal structure from observational data with the principles behind the Kolmogorov Minimal Sufficient Statist...
Jan Lemeire, Kris Steenhaut
KDD
2007
ACM
168views Data Mining» more  KDD 2007»
14 years 10 months ago
A probabilistic framework for relational clustering
Relational clustering has attracted more and more attention due to its phenomenal impact in various important applications which involve multi-type interrelated data objects, such...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
SWAT
2010
Springer
250views Algorithms» more  SWAT 2010»
14 years 2 months ago
Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...
Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov...