1332 search results - page 28 / 267 » An Efficient Algorithm for the Approximate Median Selection ... |
129
Voted
CVPR
1998
IEEE
16 years 5 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...
AIPS
1998
15 years 4 months ago
1998
The choice of an appropriate problem-solving method, from available methods, is a crucial skill for experts in many areas. We describe a technique for the automatic selection amon...
125
click to vote
ESA
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. In the present work, we are interested in the practical behavior of a new fptas to solve the approximation version of the 0-1 multiobjective knapsack problem. Nevertheles...
123
click to vote
CEC
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract— This paper presents a new efficient multiobjective evolutionary algorithm for solving computationallyintensive optimization problems. To support a high degree of parall...
243
Voted
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...