Sciweavers

60 search results - page 6 / 12
» Variable length path coupling
Sort
View
ICCD
2001
IEEE
90views Hardware» more  ICCD 2001»
14 years 4 months ago
Interconnect-centric Array Architectures for Minimum SRAM Access Time
‡ Physical and generic models that analytically couple the array architecture of CMOS SRAMs with the wire lengths and fan-outs along critical paths to decode and sense data are r...
Azeez J. Bhavnagarwala, Stephen V. Kosonocky, Jame...
CP
2008
Springer
13 years 9 months ago
CPBPV: A Constraint-Programming Framework for Bounded Program Verification
Abstract. This paper studies how to verify the conformity of a program with its specification and proposes a novel constraint-programming framework for bounded program verification...
Hélène Collavizza, Michel Rueher, Pa...
HISB
2011
111views more  HISB 2011»
12 years 7 months ago
Spinal Cord Segmentation for Volume Estimation in Healthy and Multiple Sclerosis Subjects Using Crawlers and Minimal Paths
—Spinal cord analysis is an important problem in the study of various neurological diseases. Current segmentation and analysis methods in clinical use are slow and laborintensive...
Chris McIntosh, Ghassan Hamarneh, Matthew Toom, Ro...
CISS
2008
IEEE
14 years 1 months ago
End-to-end bandwidth and available bandwidth estimation in multi-hop IEEE 802.11b ad hoc networks
—In this paper we estimate the end-to-end total bandwidth (BW) and available bandwidth (ABW) of a path between a pair of nodes in an IEEE 802.11b ad hoc network, both as function...
Marco A. Alzate, Jose-Carlos Pagan, Néstor ...
RECOMB
2010
Springer
13 years 5 months ago
Novel Definition and Algorithm for Chaining Fragments with Proportional Overlaps
Chaining fragments is a crucial step in genome alignment. Existing chaining algorithms compute a maximum weighted chain with no overlaps allowed between adjacent fragments. In prac...
Raluca Uricaru, Alban Mancheron, Eric Rivals