2168 search results - page 388 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
146
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
159
Voted
MOBIHOC
2005
ACM
16 years 3 months ago
2005
ACM
Node compromise poses severe security threats in wireless sensor networks. Unfortunately, existing security designs can address only a small, fixed threshold number of compromised...
136
click to vote
ICS
2009
Tsinghua U.
15 years 10 months ago
2009
Tsinghua U.
Several existing compiler transformations can help improve communication-computation overlap in MPI applications. However, traditional compilers treat calls to the MPI library as ...
126
Voted
COCO
2009
Springer
15 years 10 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
145
Voted
MM
2009
ACM
15 years 10 months ago
2009
ACM
In this work, we investigate how to automatically reassign the manually annotated labels at the image-level to those contextually derived semantic regions. First, we propose a bi-...