1161 search results - page 112 / 233 » Approximation schemes for clustering problems |
120
Voted
INFOCOM
2007
IEEE
15 years 9 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...
117
Voted
ICRA
2008
IEEE
15 years 10 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 ...
138
Voted
SIAMMAX
2010
14 years 10 months 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...
122
Voted
SIGCOMM
1999
ACM
15 years 7 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...
161
click to vote
KDD
2009
ACM
16 years 4 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...