16504 search results - page 153 / 3301 » New Problems, New Solutions |
175
click to vote
IJCAI
2007
15 years 7 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
210
click to vote
MVA
2008
15 years 6 months ago
2008
This paper presents a new graph cut-based multiple active contour algorithm to detect optimal boundaries and regions in images without initial contours and seed points. The task of...
162
click to vote
ICPR
2002
IEEE
16 years 7 months ago
2002
IEEE
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
167
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
State-of-the-art automated theorem provers (ATPs) are today able to solve relatively complicated mathematical problems. But as ATPs become stronger and more used by mathematicians...
145
click to vote
ICIP
2001
IEEE
16 years 8 months ago
2001
IEEE
In this paper, we introduce a completely new approach to fitting rectangles and squares to given closed regions using our published ideas in [6], [7], [8]. In these papers, we hav...