Sciweavers

908 search results - page 70 / 182
» Temporal Analysis of Time Bounded Digital Systems
Sort
View
BMCBI
2010
129views more  BMCBI 2010»
14 years 10 months ago
A temporal precedence based clustering method for gene expression microarray data
Background: Time-course microarray experiments can produce useful data which can help in understanding the underlying dynamics of the system. Clustering is an important stage in m...
Ritesh Krishna, Chang-Tsun Li, Vicky Buchanan-Woll...
SPAA
2006
ACM
15 years 3 months ago
A performance analysis of local synchronization
Synchronization is often necessary in parallel computing, but it can create delays whenever the receiving processor is idle, waiting for the information to arrive. This is especia...
Julia Lipman, Quentin F. Stout
SAS
2009
Springer
281views Formal Methods» more  SAS 2009»
15 years 10 months ago
A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
David Niedzielski, Jeffery von Ronne, Andreas Gamp...
ECRTS
2007
IEEE
15 years 4 months ago
A Delay Composition Theorem for Real-Time Pipelines
Uniprocessor schedulability theory made great strides, in part, due to the simplicity of composing the delay of a job from the execution times of higher-priority jobs that preempt...
Praveen Jayachandran, Tarek F. Abdelzaher
PODC
2006
ACM
15 years 3 months ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer