2168 search results - page 185 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
143
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
155
click to vote
MOBIHOC
2010
ACM
15 years 2 months ago
2010
ACM
Passive monitoring utilizing distributed wireless sniffers is an effective technique to monitor activities in wireless infrastructure networks for fault diagnosis, resource manage...
145
click to vote
UAI
2000
15 years 5 months ago
2000
In this paper we address the problem of learning the structure of a Bayesian network in domains with continuous variables. This task requires a procedure for comparing different c...
148
click to vote
MLDM
1999
Springer
15 years 8 months ago
1999
Springer
In large content-based image database applications, e cient information retrieval depends heavily on good indexing structures of the extracted features. While indexing techniques f...
144
click to vote
CVPR
2003
IEEE
16 years 6 months ago
2003
IEEE
We describe some techniques that can be used to represent and detect deformable shapes in images. The main difficulty with deformable template models is the very large or infinite...