2340 search results - page 24 / 468 » Copying and Comparing: Problems and Solutions |
112
click to vote
ECCV
2006
Springer
16 years 1 months ago
2006
Springer
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with som...
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
In multiobjective particle swarm optimization (MOPSO) methods, selecting the local best and the global best for each particle of the population has a great impact on the convergen...
77
Voted
BIRTHDAY
2009
Springer
15 years 6 months ago
2009
Springer
Consider a tree T and a forest F. The paper discusses the following new problems: The Forest vertex-cover problem (FVC): cover the vertices of T by a minimum number of copies of tr...
101
click to vote
INFOCOM
1995
IEEE
15 years 3 months ago
1995
IEEE
Establishing a multicast tree in a point-to-point network of switch nodes, such as a wide-area ATM network, is often modeled as the NP-complete Steiner problem in networks. In thi...
UAI
2003
15 years 1 months ago
2003
This paper examines a number of solution methods for decision processes with non-Markovian rewards (NMRDPs). They all exploit a temporal logic specification of the reward functio...