Sciweavers

4315 search results - page 250 / 863
» Sorting in linear time
Sort
View
AUTOMATICA
2006
91views more  AUTOMATICA 2006»
13 years 9 months ago
Necessary and sufficient conditions for reachability on a simplex
In this paper we solve the general problem of designing a feedback controller to reach a set of facets of an n-dimensional simplex in finite time, for a system evolving with linea...
Bartek Roszak, Mireille E. Broucke
JSC
2002
61views more  JSC 2002»
13 years 9 months ago
Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm
This paper describes a new algorithm for computing linear generators (vector generating polynomials) for matrix sequences, running in subquadratic time. This algorithm applies in ...
Emmanuel Thomé
PC
2011
314views Management» more  PC 2011»
13 years 4 months ago
Restart strategies in optimization: parallel and serial cases
This paper addresses the problem of minimizing the average running time of the Las Vegas type algorithm, both in serial and parallel setups. The necessary conditions for the exist...
Oleg V. Shylo, Timothy Middelkoop, Panos M. Pardal...
CSR
2009
Springer
14 years 4 months ago
On the Complexity of Matroid Isomorphism Problems
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...
B. V. Raghavendra Rao, Jayalal M. N. Sarma
ICIP
2006
IEEE
14 years 11 months ago
New Results on Efficient Optimal Multilevel Image Thresholding
Image thresholding is one of the most common image processing operations, since almost all image processing schemes need some sort of separation of the pixels into different class...
Martin Luessi, Marco Eichmann, Guido M. Schuster, ...