Sciweavers

730 search results - page 45 / 146
» Combinatorics of Monotone Computations
Sort
View
CPM
2008
Springer
154views Combinatorics» more  CPM 2008»
13 years 10 months ago
Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots
We present an algorithm for computing the edit distance of two RNA structures with arbitrary kinds of pseudoknots. A main benefit of the algorithm is that, despite the problem is N...
Mathias Möhl, Sebastian Will, Rolf Backofen
COMBINATORICS
2000
114views more  COMBINATORICS 2000»
13 years 8 months ago
Trees and Matchings
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
Richard Kenyon, James Gary Propp, David Bruce Wils...
DAC
2003
ACM
14 years 9 months ago
Quantum-dot cellular automata: computing by field polarization
As CMOS technology continues its monotonic shrink, computing with quantum dots remains a goal in nanotechnology research. Quantum-dot cellular automata (QCA) is a paradigm for low...
Gary H. Bernstein
PERCOM
2007
ACM
14 years 8 months ago
Distributed, Uncertainty-Aware Access Control for Pervasive Computing
Access control to sensitive resources in pervasive computing needs to take uncertainty into account. Previous research has developed uncertainty-aware access-control models for en...
Urs Hengartner, Ge Zhong
ASP
2005
Springer
14 years 2 months ago
Possibilistic Stable Model Computing
Possibilistic Stable model Semantics is an extension of Stable Model Semantics that allows to merge uncertain and non monotonic reasoning into a unique framework. To achieve this a...
Pascal Nicolas, Claire Lefèvre