Sciweavers

803 search results - page 113 / 161
» Independence in Direct-Product Graphs
Sort
View
COCO
1997
Springer
144views Algorithms» more  COCO 1997»
14 years 20 days ago
Polynomial Vicinity Circuits and Nonlinear Lower Bounds
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
Kenneth W. Regan
ICDCS
1996
IEEE
14 years 20 days ago
Making Trust Explicit in Distributed Commerce Transactions
In a distributed environment where nodes are independently motivated, many transactions or commercial exchanges may be stymied due to a lack of trust between the participants. The...
Steven P. Ketchpel, Hector Garcia-Molina
GI
1997
Springer
14 years 20 days ago
Architecture and Search Organization for Large Vocabulary Continuous Speech Recognition
This paper gives an overview of an architecture and search organization for large vocabulary, continuous speech recognition (LVCSR at RWTH). In the rst part of the paper, we descri...
Stefan Ortmanns, Lutz Welling, Klaus Beulen, Frank...
EURODAC
1990
IEEE
92views VHDL» more  EURODAC 1990»
14 years 17 days ago
Accelerated test pattern generation by cone-oriented circuit partitioning
In this paper an efficient cone oriented circuit partitioning method is presented, which significantly speeds up automatic test pattern generation for combinational circuits. The ...
Torsten Grüning, Udo Mahlstedt, Wilfried Daeh...
FUN
2007
Springer
80views Algorithms» more  FUN 2007»
14 years 11 days ago
The Traveling Beams Optical Solutions for Bounded NP-Complete Problems
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
Shlomi Dolev, Hen Fitoussi