4137 search results - page 294 / 828 » On the number of matchings of a tree |
179
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
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...
210
click to vote
ESWA
2006
15 years 6 months ago
2006
In recent years, there have been many studies focusing on improving the accuracy of prediction of transmembrane segments, and many significant results have been achieved. In spite...
171
click to vote
QEST
2008
IEEE
16 years 1 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
223
click to vote
FC
2007
Springer
16 years 29 days ago
2007
Springer
Task-specific groups are often formed in an ad-hoc manner within big structures, like companies. Take the following typical scenario: A high rank manager decides that a task force...
159
click to vote
INFOCOM
2005
IEEE
16 years 11 days ago
2005
IEEE
— Medard, Finn, Barry and Gallager proposed an elegant recovery scheme (known as the MFBG scheme) using redundant trees. Xue, Chen and Thulasiraman extended the MFBG scheme and i...