Sciweavers

4118 search results - page 88 / 824
» Efficient Algorithms for Airline Problem
Sort
View
NA
2008
80views more  NA 2008»
15 years 3 months ago
Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations
In this paper we address the problem of efficiently computing all the eigenvalues of a large N
Yuli Eidelman, Luca Gemignani, Israel Gohberg
105
Voted
SAC
2005
ACM
15 years 9 months ago
Rearranging data objects for efficient and stable clustering
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...
Gyesung Lee, Xindong Wu, Jinho Chon
IPPS
1994
IEEE
15 years 7 months ago
Efficient Matrix Chain Ordering in Polylog Time
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 ...
Phillip G. Bradford, Gregory J. E. Rawlins, Gregor...
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 3 months ago
Efficient Minimization of Decomposable Submodular Functions
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...
Peter Stobbe, Andreas Krause
ECCV
2008
Springer
16 years 5 months ago
Automatic Generator of Minimal Problem Solvers
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...
Martin Bujnak, Tomás Pajdla, Zuzana Kukelov...