4114 search results - page 120 / 823 » Efficient Algorithms for the 2-Center Problems |
122
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of co...
132
click to vote
ECCV
2008
Springer
16 years 7 months ago
2008
Springer
Abstract. Finding solutions to minimal problems for estimating epipolar geometry and camera motion leads to solving systems of algebraic equations. Often, these systems are not tri...
149
click to vote
CORR
2011
Springer
15 years 2 days ago
2011
Springer
In this paper we present clustering method is very sensitive to the initial center values ,requirements on the data set too high, and cannot handle noisy data the proposal method ...
142
click to vote
STOC
2003
ACM
16 years 5 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
139
click to vote
EVOW
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of an algorithm. Moreover, o...