563 search results - page 19 / 113 » Computing approximate PSD factorizations |
189
Voted
INFOCOM
2012
IEEE
13 years 3 months ago
2012
IEEE
—Accurate localization in wireless sensor networks is the foundation for many applications, such as geographic routing and position-aware data processing. An important research d...
101
click to vote
ICDM
2008
IEEE
15 years 7 months ago
2008
IEEE
Recently Non-negative Matrix Factorization (NMF) has received a lot of attentions in information retrieval, computer vision and pattern recognition. NMF aims to find two non-nega...
104
Voted
IPSN
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. The issue of data association arises frequently in sensor networks; whenever multiple sensors and sources are present, it may be necessary to determine which observations...
125
click to vote
DAGSTUHL
2007
15 years 2 months ago
2007
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor α that spre...
128
click to vote
FSTTCS
2004
Springer
15 years 6 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...