Sciweavers

215 search results - page 3 / 43
» On the number of factorizations of a full cycle
Sort
View
ICCAD
2004
IEEE
121views Hardware» more  ICCAD 2004»
14 years 4 months ago
Factoring and eliminating common subexpressions in polynomial expressions
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and graphics applications, which provide good opportunities...
Anup Hosangadi, Farzan Fallah, Ryan Kastner
GLOBECOM
2010
IEEE
13 years 5 months ago
Achieving Full Rate Network Coding with Constellation Compatible Modulation and Coding
Network coding is an effective method to improving relay efficiency by reducing the number of transmissions. However, its performance is limited by several factors such as packet l...
Suhua Tang, Hiroyuki Yomo, Tetsuro Ueda, Ryu Miura...
POPL
1996
ACM
13 years 11 months ago
A Provably Time-Efficient Parallel Implementation of Full Speculation
that defines abstract costs for measuring or analyzing the performance of computations, (2) to supply the users with a mapping of these costs onto runtimes on various machine model...
John Greiner, Guy E. Blelloch
BMCBI
2010
146views more  BMCBI 2010»
13 years 7 months ago
On the Choice and Number of Microarrays for Transcriptional Regulatory Network Inference
Background: Transcriptional regulatory network inference (TRNI) from large compendia of DNA microarrays has become a fundamental approach for discovering transcription factor (TF)...
Elissa J. Cosgrove, Timothy S. Gardner, Eric D. Ko...
ICDCN
2011
Springer
12 years 11 months ago
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
Valerie King, Steven Lonargan, Jared Saia, Amitabh...