Sciweavers

449 search results - page 55 / 90
» Degenerate crossing numbers
Sort
View
QEST
2006
IEEE
15 years 3 months ago
Exploring correctness and accuracy of solutions to matrix polynomial equations in queues
Spectral expansion and matrix analytic methods are important solution mechanisms for matrix polynomial equations. These equations are encountered in the steady-state analysis of M...
David Thornley, Harf Zatschler
SIPS
2006
IEEE
15 years 3 months ago
Molecular quantum-dot cellular automata
: Molecular electronics is commonly conceived as reproducing diode or transistor action at the molecular level. The quantum-dot cellular automata (QCA) approach offers an attractiv...
Craig S. Lent
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
15 years 1 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
CORR
2008
Springer
138views Education» more  CORR 2008»
14 years 9 months ago
Computing Minimum Spanning Trees with Uncertainty
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...
JIB
2006
78views more  JIB 2006»
14 years 9 months ago
Prediction of transcription factor binding to DNA using rule induction methods
In this study, we seek to develop a predictive model for finding the strength of binding between a particular transcription factor (TF) variant and a particular DNA target variant...
Mikael Huss, Karin Nordström