Sciweavers

1332 search results - page 28 / 267
» An Efficient Algorithm for the Approximate Median Selection ...
Sort
View
CVPR
1998
IEEE
14 years 10 months ago
Markov Random Fields with Efficient Approximations
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...
Yuri Boykov, Olga Veksler, Ramin Zabih
AIPS
1998
13 years 9 months ago
How to Solve It Automatically: Selection Among Problem Solving Methods
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...
Eugene Fink
ESA
2007
Springer
122views Algorithms» more  ESA 2007»
14 years 10 days ago
A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem
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...
Cristina Bazgan, Hadrien Hugot, Daniel Vanderpoote...
CEC
2008
IEEE
14 years 2 months ago
A parallel surrogate-assisted multi-objective evolutionary algorithm for computationally expensive optimization problems
Abstract— This paper presents a new efficient multiobjective evolutionary algorithm for solving computationallyintensive optimization problems. To support a high degree of parall...
Anna Syberfeldt, Henrik Grimm, Amos Ng, Robert Ivo...
SIGMOD
2009
ACM
269views Database» more  SIGMOD 2009»
14 years 8 months ago
Efficient approximate entity extraction with edit distance constraints
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...
Wei Wang 0011, Chuan Xiao, Xuemin Lin, Chengqi Zha...