Sciweavers

39 search results - page 7 / 8
» A probabilistic analysis of a greedy algorithm arising from ...
Sort
View
IPSN
2009
Springer
14 years 1 months ago
Distributed resource management and matching in sensor networks
We consider a scenario in which there are resources at or near nodes of a network, which are either static (e.g. fire stations, parking spots) or mobile (e.g. police cars). Over ...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...
ICML
2008
IEEE
14 years 7 months ago
Expectation-maximization for sparse and non-negative PCA
We study the problem of finding the dominant eigenvector of the sample covariance matrix, under additional constraints on the vector: a cardinality constraint limits the number of...
Christian D. Sigg, Joachim M. Buhmann
RECOMB
2002
Springer
14 years 6 months ago
Discovering local structure in gene expression data: the order-preserving submatrix problem
This paper concerns the discovery of patterns in gene expression matrices, in which each element gives the expression level of a given gene in a given experiment. Most existing me...
Amir Ben-Dor, Benny Chor, Richard M. Karp, Zohar Y...
JSC
2010
155views more  JSC 2010»
13 years 4 months ago
Algorithms for solving linear systems over cyclotomic fields
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
Liang Chen, Michael B. Monagan
CVPR
2004
IEEE
14 years 8 months ago
Shape Correspondence through Landmark Sliding
Motivated by improving statistical shape analysis, this paper presents a novel landmark-based method for accurate shape correspondence, where the general goal is to align multiple...
Song Wang, Toshiro Kubota, Theodor Richardson