4112 search results - page 104 / 823 » Efficient Algorithms for the Spoonerism Problem |
112
click to vote
CORR
2010
Springer
15 years 4 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...
116
click to vote
SAC
2005
ACM
15 years 9 months ago
2005
ACM
When a partitional structure is derived from a data set using a data mining algorithm, it is not unusual to have a different set of outcomes when it runs with a different order of...
121
Voted
IPPS
1994
IEEE
15 years 8 months ago
1994
IEEE
The matrix chain ordering problem is to find the cheapest way to multiply a chain of n matrices, where the matrices are pairwise compatible but of varying dimensions. Here we give ...
123
click to vote
ECCV
2008
Springer
16 years 6 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...
139
click to vote
CORR
2011
Springer
14 years 11 months 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 ...