Sciweavers

170 search results - page 23 / 34
» A Bounding Quantifier
Sort
View
DAC
2004
ACM
16 years 20 days ago
A SAT-based algorithm for reparameterization in symbolic simulation
Parametric representations used for symbolic simulation of circuits usually use BDDs. After a few steps of symbolic simulation, state set representation is converted from one para...
Pankaj Chauhan, Edmund M. Clarke, Daniel Kroening
ISAAC
2007
Springer
102views Algorithms» more  ISAAC 2007»
15 years 5 months ago
Depth of Field and Cautious-Greedy Routing in Social Networks
Social networks support efficient decentralized search: people can collectively construct short paths to a specified target in the network. Rank-based friendship—where the prob...
David Barbella, George Kachergis, David Liben-Nowe...
ICIP
2005
IEEE
16 years 1 months ago
Pedestrian classification from moving platforms using cyclic motion pattern
This paper describes an efficient pedestrian detection system for videos acquired from moving platforms. Given a detected and tracked object as a sequence of images within a bound...
Yang Ran, Qinfen Zheng, Isaac Weiss, Larry S. Davi...
VLSID
2004
IEEE
117views VLSI» more  VLSID 2004»
16 years 2 days ago
Evaluating the Reliability of Defect-Tolerant Architectures for Nanotechnology with Probabilistic Model Checking
As we move from deep submicron technology to nanotechnology for device manufacture, the need for defect-tolerant architectures is gaining importance. This is because, at the nanos...
Gethin Norman, David Parker, Marta Z. Kwiatkowska,...
95
Voted
ICC
2009
IEEE
170views Communications» more  ICC 2009»
15 years 6 months ago
Transmission Capacity of Two-Way Communication in Wireless Ad Hoc Networks
—Wireless ad hoc networks require bidirectional data transmission to support two-way traffic and control functions like packet acknowledgement. Most prior work on the capacity o...
Kien T. Truong, Steven Weber, Robert W. Heath Jr.