Sciweavers

4378 search results - page 15 / 876
» On the Complexity of Ordered Colourings
Sort
View
CSL
2009
Springer
14 years 2 months ago
On the Parameterised Intractability of Monadic Second-Order Logic
One of Courcelle’s celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic (MSO2) is fixed-parameter t...
Stephan Kreutzer
TVCG
2012
191views Hardware» more  TVCG 2012»
11 years 10 months ago
Direct Isosurface Visualization of Hex-Based High-Order Geometry and Attribute Representations
—In this paper, we present a novel isosurface visualization technique that guarantees the accurate visualization of isosurfaces with complex attribute data defined on (un)structu...
Tobias Martin, Elaine Cohen, Mike Kirby
COCOON
2006
Springer
13 years 11 months ago
Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard
We present an efficient reduction mapping undirected graphs G with n = 2k vertices for integers k to tables of partially specified Boolean functions g : {0, 1}4k+1 {0, 1, } so tha...
Jesper Torp Kristensen, Peter Bro Miltersen
GRAPHICSINTERFACE
2009
13 years 5 months ago
Rendering the effect of labradoescence
Labradorescence is a complex optical phenomenon that can be found in certain minerals, such as Labradorite or Spectrolite. Because of their unique colour properties, these mineral...
Andrea Weidlich, Alexander Wilkie
AAAI
2012
11 years 10 months ago
A Tractable First-Order Probabilistic Logic
Tractable subsets of first-order logic are a central topic in AI research. Several of these formalisms have been used as the basis for first-order probabilistic languages. Howev...
Pedro Domingos, William Austin Webb