459 search results - page 64 / 92 » Computational Complexity of Probabilistic Disambiguation |
115
click to vote
FOCS
1995
IEEE
15 years 3 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
104
click to vote
ECCV
2004
Springer
16 years 1 months ago
2004
Springer
Data association (obtaining correspondences) is a ubiquitous problem in computer vision. It appears when matching image features across multiple images, matching image features to ...
DAC
1996
ACM
15 years 3 months ago
1996
ACM
Iterative-improvement 2-way min-cut partitioning is an important phase in most circuit partitioning tools. Most iterative improvement techniques for circuit netlists like the Fidd...
101
click to vote
MOBISYS
2007
ACM
15 years 2 months ago
2007
ACM
— Perhaps the most significant challenge in design of on-body sensors is the wearability concern. This concern requires that the size of the nodes (sensors, processing units and ...
105
click to vote
WS
2006
ACM
15 years 5 months ago
2006
ACM
In this paper, we propose a formal notion of network security for ad hoc networks. We adopt a probabilistic security framework, that is, security is defined by a polynomially bou...