Sciweavers

1871 search results - page 127 / 375
» The Ephemeral Pairing Problem
Sort
View
ASPDAC
2009
ACM
144views Hardware» more  ASPDAC 2009»
15 years 4 months ago
Complete-k-distinguishability for retiming and resynthesis equivalence checking without restricting synthesis
Iterative retiming and resynthesis is a powerful way to optimize sequential circuits but its massive adoption has been hampered by the hardness of verification. This paper tackle...
Nikolaos D. Liveris, Hai Zhou, Prithviraj Banerjee
ISW
2000
Springer
15 years 3 months ago
A Signcryption Scheme Based on Integer Factorization
Abstract. Signcryption is a public-key cryptographic primitive introduced by Zheng, which achieves both message confidentiality and nonrepudiatable origin authenticity, at a lower ...
Ron Steinfeld, Yuliang Zheng
ESA
2008
Springer
100views Algorithms» more  ESA 2008»
15 years 1 months ago
Improved Approximation Algorithms for Relay Placement
In the relay placement problem the input is a set of sensors and a number r 1, the communication range of a relay. In the one-tier version of the problem the objective is to place...
Alon Efrat, Sándor P. Fekete, Poornananda R...
BIOCOMP
2008
15 years 29 days ago
Bioinformatics Tools: Searching for Markers in DNA/RNA Sequences
Research in bioinformatics and computational biology relies heavily on algorithms that facilitate the understanding of biological processes through the application of statistical ...
Kuha Mahalingam, Omar Bagasra
CORR
2010
Springer
126views Education» more  CORR 2010»
14 years 11 months ago
Visibility maintenance via controlled invariance for leader-follower Dubins-like vehicles
The paper studies the visibility maintenance problem (VMP) for a leader-follower pair of robots modelled as first-order dynamic systems and proposes an original solution based on t...
Fabio Morbidi, Francesco Bullo, Domenico Prattichi...