Sciweavers

4315 search results - page 132 / 863
» Sorting in linear time
Sort
View
DATE
2010
IEEE
120views Hardware» more  DATE 2010»
14 years 2 months ago
Linear programming approach for performance-driven data aggregation in networks of embedded sensors
Abstract—Cyber Physical Systems are distributed systemsof-systems that integrate sensing, processing, networking and actuation. Aggregating physical data over space and in time e...
Cristian Ferent, Varun Subramanian, Michael Gilber...
IPPS
1999
IEEE
14 years 1 months ago
Parallel Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System
The known fast sequential algorithms for multiplying two N N matrices (over an arbitrary ring) have time complexity ON , where 2 3. The current best value of is less than 2.3755....
Keqin Li, Victor Y. Pan
PDPTA
2007
13 years 10 months ago
Scheduling Divisible Workloads from Multiple Sources in Linear Daisy Chain Networks
— This paper considers scheduling divisible workloads from multiple sources in linear networks of processors. We propose a two phase scheduling strategy (TPSS) to minimize the ov...
Xinxin Liu, Han Zhao, Xiaolin Li
DM
2006
91views more  DM 2006»
13 years 9 months ago
Fast perfect sampling from linear extensions
In this paper, we study the problem of sampling (exactly) uniformly from the set of linear extensions of an arbitrary partial order. Previous Markov chain techniques have yielded ...
Mark Huber
CORR
2007
Springer
109views Education» more  CORR 2007»
13 years 9 months ago
Multiresolution Approximation of Polygonal Curves in Linear Complexity
: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality b...
Pierre-Francois Marteau, Gildas Ménier