Sciweavers

18306 search results - page 222 / 3662
» Algorithmics in Exponential Time
Sort
View
JMLR
2006
91views more  JMLR 2006»
15 years 2 months ago
QP Algorithms with Guaranteed Accuracy and Run Time for Support Vector Machines
We describe polynomial
Don R. Hush, Patrick Kelly, Clint Scovel, Ingo Ste...
136
Voted
ICCV
2003
IEEE
16 years 4 months ago
A Sparse Probabilistic Learning Algorithm for Real-Time Tracking
This paper addresses the problem of applying powerful pattern recognition algorithms based on kernels to efficient visual tracking. Recently Avidan [1] has shown that object recog...
Oliver M. C. Williams, Andrew Blake, Roberto Cipol...
126
Voted
ICDCS
2007
IEEE
15 years 9 months ago
Streaming Algorithms for Robust, Real-Time Detection of DDoS Attacks
Effective mechanisms for detecting and thwarting Distributed Denial-of-Service (DDoS) attacks are becoming increasingly important to the success of today’s Internet as a viable ...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
COLT
2005
Springer
15 years 8 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon
131
Voted
ISAAC
2009
Springer
108views Algorithms» more  ISAAC 2009»
15 years 9 months ago
Linear and Sublinear Time Algorithms for Basis of Abelian Groups
It is well known that every finite abelian group G can be represented as a direct product of cyclic groups: G ∼= G1 × G2 × · · · × Gt, where each Gi is a cyclic group of ...
Li Chen, Bin Fu