2137 search results - page 371 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
122
click to vote
MIRAGE
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. This paper is concerned itself with the analysis of the twophase Mumford-Shah model also known as the active contour without edges model introduced by Chan and Vese. It c...
111
Voted
DEXAW
2005
IEEE
15 years 8 months ago
2005
IEEE
For several reasons a database may not satisfy certain integrity constraints (ICs). However, most likely most of the information in it is still consistent with the ICs; and could ...
GECCO
2003
Springer
15 years 7 months ago
2003
Springer
While genetically inspired approaches to multi-objective optimization have many advantages over conventional approaches, they do not explicitly exploit directional/gradient informa...
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...
93
Voted
CONSTRAINTS
2007
15 years 2 months ago
2007
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...