Sciweavers

441 search results - page 70 / 89
» A Method for Proving Observational Equivalence
Sort
View
AMAI
2007
Springer
13 years 9 months ago
Decision procedures for extensions of the theory of arrays
The theory of arrays, introduced by McCarthy in his seminal paper “Toward a mathematical science of computation”, is central to Computer Science. Unfortunately, the theory alo...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...
BMCBI
2005
99views more  BMCBI 2005»
13 years 8 months ago
Effective ambiguity checking in biosequence analysis
Background: Ambiguity is a problem in biosequence analysis that arises in various analysis tasks solved via dynamic programming, and in particular, in the modeling of families of ...
Janina Reeder, Peter Steffen, Robert Giegerich
COMBINATORICS
2000
84views more  COMBINATORICS 2000»
13 years 8 months ago
A Note on the Asymptotic Behavior of the Heights in b-Tries for b Large
We study the limiting distribution of the height in a generalized trie in which external nodes are capable to store up to b items (the so called b-tries). We assume that such a tr...
Charles Knessl, Wojciech Szpankowski
ITIIS
2010
158views more  ITIIS 2010»
13 years 3 months ago
Development of a Dynamic Collision Avoidance Algorithm for Indoor Tracking System Based on Active RFID
We propose a novel collision-avoidance algorithm for the active type RFID regarding an indoor tracking system. Several well-known collision avoidance algorithms are analyzed consi...
Sekyung Han, Yeonsuk Choi, Masayuki Iwai, Kaoru Se...
VLSID
2004
IEEE
147views VLSI» more  VLSID 2004»
14 years 9 months ago
Computing Silent Gate Models for Noise Analysis from Slew and Delay Tables
Abstract--In this paper, we present a new approach to calculate the steady state resistance values for CMOS library gates. These resistances are defined as simple equivalent models...
Shabbir H. Batterywala, Narendra V. Shenoy