1554 search results - page 248 / 311 » Parameterized Complexity and Approximation Algorithms |
BMCBI
2005
14 years 11 months ago
2005
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
105
click to vote
AVSS
2008
IEEE
15 years 6 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...
109
click to vote
FOCS
2008
IEEE
15 years 6 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 ...
SSDBM
2003
IEEE
15 years 5 months ago
2003
IEEE
Space constrained optimization problems arise in a multitude of important applications such as data warehouses and pervasive computing. A typical instance of such problems is to s...
103
click to vote
PODS
2000
ACM
15 years 4 months ago
2000
ACM
We study the problem of auditing databases which support statistical sum queries to protect the security of sensitive information; we focus on the special case in which the sensit...