Sciweavers

4714 search results - page 320 / 943
» The Complexity of Iterated Multiplication
Sort
View
ICALP
1994
Springer
15 years 10 months ago
On the Cost of Recomputing: Tight Bounds on Pebbling with Faults
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
Yonatan Aumann, Judit Bar-Ilan, Uriel Feige
METMBS
2003
165views Mathematics» more  METMBS 2003»
15 years 8 months ago
GeneBox: Interactive Visualization of Microarray Data Sets
Abstract Technological advancements are constantly increasing the size and complexity of data resulting from microarray experiments. This fact has led biologists to ask complex que...
Nameeta Shah, Vladimir Filkov, Bernd Hamann, Kenne...
PDPTA
2003
15 years 8 months ago
Quaternary Arithmetic Logic Unit on a Programmable Logic Device
Common binary arithmetic operations such as addition/subtraction and multiplication suffer from O(n) carry propagation delay where n is the number of digits. Carry lookahead helps...
Songpol Ongwattanakul, Phaisit Chewputtanagul, Dav...
PERCOM
2010
ACM
15 years 5 months ago
Concurrent scheduling in the Active Bat location system
Abstract—This paper looks at the scalability problems inherent in the Active Bat system: an outside-in ultrasonic location system. Such systems are typically associated with high...
Oliver Woodman, Robert Harle
179
Voted
DAC
2000
ACM
16 years 7 months ago
MINFLOTRANSIT: min-cost flow based transistor sizing tool
This paper presents MINFLOTRANSIT, a new transistor sizing tool for fast sizing of combinational circuits with minimal cost. MINFLOTRANSIT is an iterative relaxation based tool th...
Vijay Sundararajan, Sachin S. Sapatnekar, Keshab K...