1161 search results - page 112 / 233 » Approximation schemes for clustering problems |
142
click to vote
INFOCOM
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract— Providing efficient data aggregation while preserving data privacy is a challenging problem in wireless sensor networks research. In this paper, we present two privacy...
134
click to vote
ICRA
2008
IEEE
15 years 12 months ago
2008
IEEE
Abstract— We propose a new approximate algorithm, LAJIV (Lookahead J-MDP Information Value), to solve Oracular Partially Observable Markov Decision Problems (OPOMDPs), a special ...
172
click to vote
SIAMMAX
2010
15 years 7 days ago
2010
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...
143
click to vote
SIGCOMM
1999
ACM
15 years 9 months ago
1999
ACM
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
184
click to vote
KDD
2009
ACM
16 years 6 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...