Sciweavers

871 search results - page 115 / 175
» The vertex-cover polynomial of a graph
Sort
View
COLING
2000
14 years 11 months ago
Generation, Lambek Calculus, Montague's Semantics and Semantic Proof Nets
Most of the studies in the framework of Lambek calculus have considered the parsing process and ignored the generation process. This paper wants to rely on the close link between ...
Sylvain Pogodalla
ISMB
1997
14 years 11 months ago
Automated Alignment of RNA Sequences to Pseudoknotted Structures
Seq7 is a newprogramfor generating multiple structure-based alignments of RNAsequences. Byusing a variant of Dijkstra’s algorithm to find the shortest path through a specially c...
Jack E. Tabaska, Gary D. Stormo
JSC
2007
84views more  JSC 2007»
14 years 9 months ago
Simplicial cycles and the computation of simplicial trees
We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is ...
Massimo Caboara, Sara Faridi, Peter Selinger
CORR
2002
Springer
91views Education» more  CORR 2002»
14 years 9 months ago
Quantum Random Walks Hit Exponentially Faster
We show that the hitting time of the discrete time quantum random walk on the n-bit hypercube from one corner to its opposite is polynomial in n. This gives the first exponential ...
Julia Kempe
DM
2002
85views more  DM 2002»
14 years 9 months ago
Equimodular curves
This paper is a continuation of Equimodular curves, LSE-CDAM-2000-17. First, it is shown by algebraic means that the equimodular curves for a reducible matrix are closed curves. T...
Norman Biggs