2430 search results - page 265 / 486 » Computing Tutte Polynomials |
127
click to vote
LATIN
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
110
click to vote
BIRTHDAY
2009
Springer
15 years 10 months ago
2009
Springer
Consider a tree T and a forest F. The paper discusses the following new problems: The Forest vertex-cover problem (FVC): cover the vertices of T by a minimum number of copies of tr...
102
click to vote
RECOMB
2009
Springer
15 years 10 months ago
2009
Springer
Abstract Constantinos Daskalakis1 , Elchanan Mossel2, , and Sebastien Roch1 1 Microsoft Research 2 UC Berkeley and Weizman Institute We introduce a new phylogenetic reconstruction ...
138
click to vote
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
We consider the operator mapping problem for in-network stream processing, i.e., the application of a tree of operators in steady-state to multiple data objects that are continuou...
128
click to vote
LICS
2009
IEEE
15 years 10 months ago
2009
IEEE
Linear Logic is based on the analogy between algebraic linearity (i.e. commutation with sums and scalar products) and the computer science linearity (i.e. calling inputs only once...