Sciweavers

5100 search results - page 670 / 1020
» The Linear Complexity of a Graph
Sort
View
IPSN
2005
Springer
16 years 5 days ago
A scheme for robust distributed sensor fusion based on average consensus
— We consider a network of distributed sensors, where each sensor takes a linear measurement of some unknown parameters, corrupted by independent Gaussian noises. We propose a si...
Lin Xiao, Stephen P. Boyd, Sanjay Lall
LCTRTS
2005
Springer
16 years 5 days ago
A dictionary construction technique for code compression systems with echo instructions
Dictionary compression mechanisms identify redundant sequences of instructions that occur in a program. The sequences are extracted and copied to a dictionary. Each sequence is th...
Philip Brisk, Jamie Macbeth, Ani Nahapetian, Majid...
ACMMSP
2004
ACM
101views Hardware» more  ACMMSP 2004»
16 years 3 days ago
Metrics and models for reordering transformations
Irregular applications frequently exhibit poor performance on contemporary computer architectures, in large part because of their inefficient use of the memory hierarchy. Runtime ...
Michelle Mills Strout, Paul D. Hovland
CPM
2004
Springer
84views Combinatorics» more  CPM 2004»
16 years 2 days ago
Small Phylogeny Problem: Character Evolution Trees
Abstract. Phylogenetics is a science of determining connections between groups of organisms in terms of ancestor/descendent relationships, usually expressed by phylogenetic trees, ...
Arvind Gupta, Ján Manuch, Ladislav Stacho, ...
CODES
2003
IEEE
15 years 12 months ago
Deriving process networks from weakly dynamic applications in system-level design
We present an approach to the automatic derivation of executable Process Network specifications from Weakly Dynamic Applications. We introduce the notions of Dynamic Single Assig...
Todor Stefanov, Ed F. Deprettere