Sciweavers

17760 search results - page 190 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
ICCV
2003
IEEE
16 years 6 months ago
A Non-Iterative Greedy Algorithm for Multi-frame Point Correspondence
This paper presents a framework for finding point correspondences in monocular image sequences over multiple frames. The general problem of multi-frame point correspondence is NP ...
Khurram Shafique, Mubarak Shah
CORR
2006
Springer
172views Education» more  CORR 2006»
15 years 4 months ago
Approximate Convex Optimization by Online Game Playing
This paper describes a general framework for converting online game playing algorithms into constrained convex optimization algorithms. This framework allows us to convert the wel...
Elad Hazan
COLT
2007
Springer
15 years 8 months ago
An Efficient Re-scaled Perceptron Algorithm for Conic Systems
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
Alexandre Belloni, Robert M. Freund, Santosh Vempa...
GECCO
2005
Springer
108views Optimization» more  GECCO 2005»
15 years 10 months ago
Some theoretical results about the computation time of evolutionary algorithms
This paper focuses on the computation time of evolutionary algorithms. First, some exact expressions of the mean first hitting times of general evolutionary algorithms in finite...
Lixin X. Ding, Jinghu Yu
CORR
2007
Springer
78views Education» more  CORR 2007»
15 years 4 months ago
Tag-Cloud Drawing: Algorithms for Cloud Visualization
Tag clouds provide an aggregate of tag-usage statistics. They are typically sent as in-line HTML to browsers. However, display mechanisms suited for ordinary text are not ideal fo...
Owen Kaser, Daniel Lemire