986 search results - page 134 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
131
Voted
STOC
2004
ACM
16 years 3 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
115
Voted
STOC
2004
ACM
16 years 3 months ago
2004
ACM
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
141
click to vote
JCB
2006
15 years 3 months ago
2006
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
152
Voted
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
129
Voted
FGR
2004
IEEE
15 years 7 months ago
2004
IEEE
An extension of the AdaBoost learning algorithm is proposed and brought to bear on the face detection problem. In each weak classifier selection cycle, the novel totally correctiv...