Sciweavers

2542 search results - page 61 / 509
» One step ahead
Sort
View
EJC
2010
13 years 7 months ago
Exact solution of two classes of prudent polygons
Prudent walks are self-avoiding walks on a lattice which never step into the direction of an already occupied vertex. We study the closed version of these walks, called prudent po...
Uwe Schwerdtfeger
ICPR
2006
IEEE
14 years 10 months ago
Detecting Coarticulation in Sign Language using Conditional Random Fields
Coarticulation is one of the important factors that makes automatic sign language recognition a hard problem. Unlike in speech recognition, coarticulation effects in sign language...
Ruiduo Yang, Sudeep Sarkar
CVPR
2010
IEEE
14 years 2 months ago
Pushing the Envelope of Modern Methods for Bundle Adjustment
In this paper, we present results and experiments with several methods for bundle adjustment, producing the fastest bundle adjuster ever published. The fastest methods work with t...
Yekeun Jeong, David Nister, Drew Steedly, Richard ...
TNN
2010
176views Management» more  TNN 2010»
13 years 3 months ago
Sparse approximation through boosting for learning large scale kernel machines
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
Ping Sun, Xin Yao
ICCAD
2001
IEEE
201views Hardware» more  ICCAD 2001»
14 years 6 months ago
An Integrated Data Path Optimization for Low Power Based on Network Flow Method
Abstract: We propose an effective algorithm for power optimization in behavioral synthesis. In previous work, it has been shown that several hardware allocation/binding problems fo...
Chun-Gi Lyuh, Taewhan Kim, Chien-Liang Liu