Sciweavers

346 search results - page 46 / 70
» Determinizing Asynchronous Automata
Sort
View
CIIT
2004
14 years 11 months ago
Considerations on the bit error probability of optical CDMA systems
( )1 The most common metric for evaluating the performance of an optical communications system is the symbol error probability (SEP) versus the received optical power. In circuit-l...
Stefano Galli, Ronald Menendez, Russel Fischer, Ro...
TCAD
2002
146views more  TCAD 2002»
14 years 9 months ago
Static scheduling of multidomain circuits for fast functional verification
With the advent of system-on-a-chip design, many application specific integrated circuits (ASICs) now require multiple design clocks that operate asynchronously to each other. This...
Murali Kudlugi, Russell Tessier
CORR
2007
Springer
104views Education» more  CORR 2007»
14 years 10 months ago
Observable Graphs
An edge-colored directed graph is observable if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge...
Raphael M. Jungers, Vincent D. Blondel
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
15 years 7 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...
LATA
2010
Springer
15 years 4 months ago
Extending Stochastic Context-Free Grammars for an Application in Bioinformatics
We extend stochastic context-free grammars such that the probability of applying a production can depend on the length of the subword that is generated from the application and sho...
Frank Weinberg, Markus E. Nebel