Sciweavers

458 search results - page 82 / 92
» Perfect Skolem sets
Sort
View
EMSOFT
2007
Springer
15 years 6 months ago
Loosely time-triggered architectures based on communication-by-sampling
We address the problem of mapping a set of processes which communicate synchronously on a distributed platform. The Time Triggered Architecture (TTA) proposed by Kopetz for the co...
Albert Benveniste, Paul Caspi, Marco Di Natale, Cl...
IEEEPACT
2006
IEEE
15 years 5 months ago
An empirical evaluation of chains of recurrences for array dependence testing
Code restructuring compilers rely heavily on program analysis techniques to automatically detect data dependences between program statements. Dependences between statement instanc...
Johnnie Birch, Robert A. van Engelen, Kyle A. Gall...
ACIVS
2006
Springer
15 years 5 months ago
Visibility of Point Clouds and Mapping of Unknown Environments
Abstract. We present an algorithm for interpolating the visible portions of a point cloud that are sampled from opaque objects in the environment. Our algorithm projects point clou...
Yanina Landa, Richard Tsai, Li-Tien Cheng
CSB
2005
IEEE
137views Bioinformatics» more  CSB 2005»
15 years 5 months ago
A Learned Comparative Expression Measure for Affymetrix GeneChip DNA Microarrays
Perhaps the most common question that a microarray study can ask is, “Between two given biological conditions, which genes exhibit changed expression levels?” Existing methods...
Will Sheffler, Eli Upfal, John Sedivy, William Sta...
ICDCS
2005
IEEE
15 years 5 months ago
The Impossibility of Boosting Distributed Service Resilience
We prove two theorems saying that no distributed system in which processes coordinate using reliable registers and -resilient services can solve the consensus problem in the prese...
Paul C. Attie, Rachid Guerraoui, Petr Kouznetsov, ...