2168 search results - page 331 / 434 » Randomized Algorithms and Complexity Theory |
132
click to vote
WWW
2005
ACM
16 years 3 months ago
2005
ACM
While many works have been devoted to service matchmaking and modeling nonfunctional properties, the problem of matching service requests to offers in an optimal way has not yet b...
110
click to vote
KDD
2005
ACM
16 years 3 months ago
2005
ACM
Many classification tasks, such as spam filtering, intrusion detection, and terrorism detection, are complicated by an adversary who wishes to avoid detection. Previous work on ad...
135
click to vote
AVSS
2008
IEEE
15 years 9 months ago
2008
IEEE
Tracking humans in an indoor environment is an essential part of surveillance systems. Vision based and microphone array based trackers have been extensively researched in the pas...
146
click to vote
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
The central problem in computational mechanism design is the tension between incentive compatibility and computational ef ciency. We establish the rst significant approximability ...
121
click to vote
ICCV
2007
IEEE
15 years 9 months ago
2007
IEEE
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...