Sciweavers

4315 search results - page 105 / 863
» Sorting in linear time
Sort
View
ICPR
2008
IEEE
14 years 3 months ago
Constrained piecewise linear approximation of digital curves
We have considered a problem of continuous piecewise linear approximation of the digital curves with a minimum number of the line segments. Fast suboptimal algorithm for constrain...
Alexander Kolesnikov
ISAAC
1997
Springer
162views Algorithms» more  ISAAC 1997»
14 years 1 months ago
A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest
We present a randomized EREW PRAM algorithm to nd a minimum spanning forest in a weighted undirected graph. On an n-vertex graph the algorithm runs in o((logn)1+ ) expected time f...
Chung Keung Poon, Vijaya Ramachandran
BMCBI
2006
118views more  BMCBI 2006»
13 years 9 months ago
Identification of gene expression patterns using planned linear contrasts
Background: In gene networks, the timing of significant changes in the expression level of each gene may be the most critical information in time course expression profiles. With ...
Hao Li, Constance L. Wood, Yushu Liu, Thomas V. Ge...
CDC
2010
IEEE
169views Control Systems» more  CDC 2010»
13 years 4 months ago
Consensus-based distributed linear filtering
We address the consensus-based distributed linear filtering problem, where a discrete time, linear stochastic process is observed by a network of sensors. We assume that the consen...
Ion Matei, John S. Baras
FSTTCS
2006
Springer
14 years 20 days ago
Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time
Abstract. In this paper we construct fixed finite tile systems that assemble into particular classes of shapes. Moreover, given an arbitrary n, we show how to calculate the tile co...
Florent Becker, Ivan Rapaport, Eric Rémila