Sciweavers

259 search results - page 26 / 52
» Some New Directions and Questions in Parameterized Complexit...
Sort
View
IJAR
2006
125views more  IJAR 2006»
13 years 7 months ago
Computing best-possible bounds for the distribution of a sum of several variables is NP-hard
In many real-life situations, we know the probability distribution of two random variables x1 and x2, but we have no information about the correlation between x1 and x2; what are ...
Vladik Kreinovich, Scott Ferson
JACM
2006
99views more  JACM 2006»
13 years 7 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
IJAC
2011
12 years 11 months ago
The Subword Reversing Method
We summarize the main known results involving subword reversing, a method of semigroup theory for constructing van Kampen diagrams by referring to a preferred direction. In good ca...
Patrick Dehornoy
EJC
2008
13 years 7 months ago
On tension-continuous mappings
Tension-continuous (shortly TT) mappings are mappings between the edge sets of graphs. They generalize graph homomorphisms. From another perspective, tension-continuous mappings a...
Jaroslav Nesetril, Robert Sámal
APGV
2007
ACM
131views Visualization» more  APGV 2007»
13 years 11 months ago
Is accurate occlusion of glossy reflections necessary?
Much research in recent times has been conducted towards realtime rendering of accurate glossy reflections under direct, natural illumination including correct occlusions. The vie...
Oscar Kozlowski, Jan Kautz