Sciweavers

CAV
1994
Springer
111views Hardware» more  CAV 1994»
14 years 1 months ago
Automatic Verification of Timed Circuits
This paper presents a new formalism and a new algorithm for verifying timed circuits. The formalism, called orbital nets, allows hierarchical verification based on abehavioralseman...
Tomas Rokicki, Chris J. Myers
CIAC
2010
Springer
234views Algorithms» more  CIAC 2010»
14 years 1 months ago
Enumerating Rooted Graphs with Reflectional Block Structures
In this paper, we consider an arbitrary class H of rooted graphs such that each biconnected component is given by a representation with reflectional symmetry, which allows a roote...
Bingbing Zhuang and Hiroshi Nagamochi
ISCAS
1994
IEEE
124views Hardware» more  ISCAS 1994»
14 years 1 months ago
Efficient Gabor Filter Design Using Rician Output Statistics
Gabor filters have been applied sucessfully to a broad range of multidimensional signal processing and image processing tasks. The present paper considers the design of a single f...
Thomas P. Weldon, William E. Higgins, Dennis F. Du...
SPDP
1993
IEEE
14 years 1 months ago
Group Membership in a Synchronous Distributed System
This paper presents a solution to the (processor) group membership problem. The methodology followed in designing the algorithm is summarized by the option to optimize the perform...
Gianluigi Alari, Augusto Ciuffoletti
ICCAD
1994
IEEE
91views Hardware» more  ICCAD 1994»
14 years 1 months ago
A loosely coupled parallel algorithm for standard cell placement
We present a loosely coupled parallel algorithm for the placement of standard cell integrated circuits. Our algorithm is a derivative of simulated annealing. The implementation of...
Wern-Jieh Sun, Carl Sechen
HICSS
1994
IEEE
95views Biometrics» more  HICSS 1994»
14 years 1 months ago
On-Line Detection and Resolution of Communication Deadlocks
We present a new distributed algorithm that detects and resolves communication deadlocks on-line, i.e., simultaneously detects and resolves deadlock as communication requests are ...
Wee Keong Ng, Chinya V. Ravishankar
FOCS
1994
IEEE
14 years 1 months ago
The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
Michael A. Bender, Donna K. Slonim
WDAG
1997
Springer
106views Algorithms» more  WDAG 1997»
14 years 2 months ago
Performing Tasks on Restartable Message-Passing Processors
Abstract. This work presents new algorithms for the "Do-All" problem that consists of performing t tasks reliably in a message-passing synchronous system of p fault-prone...
Bogdan S. Chlebus, Roberto De Prisco, Alexander A....
PVM
1997
Springer
14 years 2 months ago
Message Handling in Parallel Radiance
Photo-realistic computergraphics is an area of research which tries to develop algorithms and methods to render images of arti cial models or worlds as realistically as possible, b...
Erik Reinhard, Alan Chalmers
STOC
1996
ACM
118views Algorithms» more  STOC 1996»
14 years 2 months ago
Towards an Analysis of Local Optimization Algorithms
We introduce a variant of Aldous and Vazirani's \Go with the winners" algorithm that can be used for search graphs that are not trees. We analyze the algorithm in terms ...
Tassos Dimitriou, Russell Impagliazzo