620 search results - page 75 / 124 » A Simple and Fast Min-cut Algorithm |
COLT
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We study two boosting algorithms, Coordinate Ascent Boosting and Approximate Coordinate Ascent Boosting, which are explicitly designed to produce maximum margins. To deri...
108
click to vote
ASIACRYPT
2008
Springer
15 years 1 months ago
2008
Springer
This paper introduces fast algorithms for performing group operations on twisted Edwards curves, pushing the recent speed limits of Elliptic Curve Cryptography (ECC) forward in a ...
VG
2003
15 years 1 months ago
2003
Finite element methods commonly use unstructured grids as the computational domain. As a matter of fact, the volume visualization of these unstructured grids is a time consuming t...
ICIP
2008
IEEE
15 years 6 months ago
2008
IEEE
Fast and accurate motion detection in the presence of camera jitter is known to be a difficult problem. Existing statistical methods often produce abundant false positives since ...
APCCAS
2006
IEEE
15 years 5 months ago
2006
IEEE
— In recent years, several approaches have been proposed aiming the optimal joint design of finite impulse response (FIR) multiple-input multiple-output (MIMO) transmitter and r...