Sciweavers

1814 search results - page 82 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
AAAI
1994
15 years 7 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
194
Voted
ICCV
2007
IEEE
16 years 8 months ago
Applications of parametric maxflow in computer vision
The maximum flow algorithm for minimizing energy functions of binary variables has become a standard tool in computer vision. In many cases, unary costs of the energy depend linea...
Vladimir Kolmogorov, Yuri Boykov, Carsten Rother
TSP
2008
180views more  TSP 2008»
15 years 5 months ago
Support Vector Machine Training for Improved Hidden Markov Modeling
We present a discriminative training algorithm, that uses support vector machines (SVMs), to improve the classification of discrete and continuous output probability hidden Markov ...
Alba Sloin, David Burshtein
COMPGEOM
2010
ACM
15 years 11 months ago
Approximating loops in a shortest homology basis from point data
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...
Tamal K. Dey, Jian Sun, Yusu Wang
CHI
2003
ACM
16 years 6 months ago
Phrase sets for evaluating text entry techniques
In evaluations of text entry methods, participants enter phrases of text using a technique of interest while performance data are collected. This paper describes and publishes (vi...
I. Scott MacKenzie, R. William Soukoreff