2252 search results - page 278 / 451 » Lower Bounds for Dynamic Algorithms |
123
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
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 ...
131
click to vote
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...
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...
157
Voted
IJCGA
2010
15 years 2 months ago
2010
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...