450 search results - page 51 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
118
click to vote
JCSS
2008
14 years 12 months ago
2008
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
120
click to vote
ACCV
2010
Springer
14 years 7 months ago
2010
Springer
Image segmentation plays an important role in many medical imaging systems, yet in complex circumstances it is still a challenging problem. Among many difficulties, problem caused ...
111
click to vote
EDBT
2009
ACM
15 years 4 months ago
2009
ACM
The discovery of complex patterns such as clusters, outliers, and associations from huge volumes of streaming data has been recognized as critical for many domains. However, patte...
112
click to vote
EGPGV
2004
Springer
15 years 5 months ago
2004
Springer
This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks w...
107
click to vote
COCO
2004
Springer
15 years 3 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...