Sciweavers

100 search results - page 13 / 20
» Faster exponential time algorithms for the shortest vector p...
Sort
View
ICIP
1998
IEEE
14 years 9 months ago
Adaptive Search Center Non-Linear Three Step Search
This paper presents a new motion estimation algorithm using an adaptive search center predicted from its adjacent blocks, and a non-linear center biased search point pattern. It d...
Hing Y. Chung, Paul Y. S. Cheung, N. H. C. Yung
ICPR
2008
IEEE
14 years 8 months ago
Accelerating active contour algorithms with the Gradient Diffusion Field
Active contours were proposed by Kass et al. as a way to represent the contours of an image. Although the method is simple, one of its shortcomings is its inability to converge in...
Willie Kiser, Pradeep Sen, Chris Musial
KDD
2008
ACM
167views Data Mining» more  KDD 2008»
14 years 8 months ago
A sequential dual method for large scale multi-class linear svms
Efficient training of direct multi-class formulations of linear Support Vector Machines is very useful in applications such as text classification with a huge number examples as w...
S. Sathiya Keerthi, S. Sundararajan, Kai-Wei Chang...
COMPGEOM
2009
ACM
14 years 2 months ago
Coresets for polytope distance
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
Bernd Gärtner, Martin Jaggi
CP
2000
Springer
14 years 6 hour ago
Optimal Anytime Constrained Simulated Annealing for Constrained Global Optimization
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
Benjamin W. Wah, Yixin Chen