Sciweavers

3192 search results - page 529 / 639
» The minimum latency problem
Sort
View
83
Voted
AAAI
2010
15 years 2 months ago
Error Aware Monocular Visual Odometry using Vertical Line Pairs for Small Robots in Urban Areas
We report a new error-aware monocular visual odometry method that only uses vertical lines, such as vertical edges of buildings and poles in urban areas as landmarks. Since vertic...
Ji Zhang, Dezhen Song
132
Voted
AIA
2007
15 years 2 months ago
A stability index for feature selection
Sequential forward selection (SFS) is one of the most widely used feature selection procedures. It starts with an empty set and adds one feature at each step. The estimate of the ...
Ludmila I. Kuncheva
100
Voted
CIMAGING
2008
104views Hardware» more  CIMAGING 2008»
15 years 2 months ago
MCMC curve sampling and geometric conditional simulation
We present an algorithm to generate samples from probability distributions on the space of curves. Traditional curve evolution methods use gradient descent to find a local minimum...
Ayres C. Fan, John W. Fisher III, Jonathan Kane, A...
110
Voted
LREC
2010
190views Education» more  LREC 2010»
15 years 2 months ago
Semi-Automatic Domain Ontology Creation from Text Resources
Analysts in various domains, especially intelligence and financial, have to constantly extract useful knowledge from large amounts of unstructured or semi-structured data. Keyword...
Mithun Balakrishna, Dan I. Moldovan, Marta Tatu, M...
111
Voted
IPCO
2008
118views Optimization» more  IPCO 2008»
15 years 2 months ago
Constraint Orbital Branching
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...