5022 search results - page 507 / 1005 » Data structures and problem solving using Java |
164
click to vote
HIS
2009
15 years 2 months ago
2009
This paper present a class of investment problem, in which many items could be chosen in a group decision environment. Usually there is a decision table from the board of director...
139
click to vote
CVPR
1998
IEEE
16 years 6 months ago
1998
IEEE
Markov Random Fields (MRF's) can be used for a wide variety of vision problems. In this paper we focus on MRF's with two-valued clique potentials, which form a generaliz...
138
click to vote
ICPR
2008
IEEE
16 years 6 months ago
2008
IEEE
On-line boosting allows to adapt a trained classifier to changing environmental conditions or to use sequentially available training data. Yet, two important problems in the on-li...
148
click to vote
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
136
click to vote
EVOW
2010
Springer
15 years 10 months ago
2010
Springer
We present an algorithmic approach to solving the problem of chromatic entropy, a combinatorial optimization problem related to graph coloring. This problem is a component in algor...