2168 search results - page 372 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
126
Voted
DEXA
2006
Springer
15 years 5 months ago
2006
Springer
Indexing high-dimensional data for efficient nearest-neighbor searches poses interesting research challenges. It is well known that when data dimension is high, the search time can...
134
Voted
TCOM
2010
15 years 2 months ago
2010
Abstract—This paper considers the problem of Gaussian symbols detection in MIMO systems in the presence of channel estimation errors. Under this framework we develop a computatio...
151
Voted
CVPR
2010
IEEE
15 years 7 months ago
2010
IEEE
In a sparse-representation-based face recognition scheme, the desired dictionary should have good representational power (i.e., being able to span the subspace of all faces) while...
126
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
Recent scaling up of decentralized partially observable Markov decision process (DEC-POMDP) solvers towards realistic applications is mainly due to approximate methods. Of this fa...
131
Voted
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...