9842 search results - page 1894 / 1969 » The Complexity of the Matching-Cut Problem |
IFIP
2001
Springer
14 years 4 days ago
2001
Springer
— Semi-formal verification based on symbolic simulation offers a good compromise between formal model checking and numerical simulation. The generation of functional test vector...
NEUROSCIENCE
2001
Springer
14 years 4 days ago
2001
Springer
We propose a theoretical framework for specification and analysis of a class of learning problems that arise in open-ended environments that contain multiple, distributed, dynamic...
WABI
2001
Springer
14 years 3 days ago
2001
Springer
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...
FOCS
2000
IEEE
14 years 3 days ago
2000
IEEE
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
CRYPTO
2000
Springer
14 years 1 days ago
2000
Springer
Private information retrieval (PIR) enables a user to retrieve a data item from a database, replicated among one or more servers, while hiding the identity of the retrieved item. ...