71228 search results - page 133 / 14246 » Algorithms |
CORR
2008
Springer
15 years 1 months ago
2008
Springer
We propose a new quantifier elimination algorithm for the theory of linear real arithmetic. This algorithm uses as subroutines satisfiability modulo this theory and polyhedral pro...
109
click to vote
DAM
2006
15 years 1 months ago
2006
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
107
click to vote
FUIN
2000
15 years 1 months ago
2000
The watershed transform is the method of choice for image segmentation in the field of mathematical morphology. We present a critical review of several definitions of the watershed...
JACM
2000
15 years 1 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
100
click to vote
NPL
2002
15 years 1 months ago
2002
The `kernel approach' has attracted great attention with the development of support vector machine (SVM) and has been studied in a general way. It offers an alternative soluti...