817 search results - page 12 / 164 » An Optimal Linear Time Algorithm for Quasi-Monotonic Segment... |
KDD
2006
ACM
14 years 9 months ago
2006
ACM
Linear Support Vector Machines (SVMs) have become one of the most prominent machine learning techniques for highdimensional sparse data commonly encountered in applications like t...
JCO
2000
13 years 8 months ago
2000
We consider the problem of off-line throughput maximization for job scheduling on one or more machines, where each job has a release time, a deadline and a profit. Most of the ver...
WCE
2007
13 years 9 months ago
2007
The focus of this paper is the problem of recursive estimation for uncertain multisensor linear discrete-time systems. We herein propose a new suboptimal filtering algorithm. The b...
ALGORITHMICA
2002
13 years 8 months ago
2002
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
SWAT
2004
Springer
14 years 1 months ago
2004
Springer
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...