Sciweavers

814 search results - page 79 / 163
» Graphical Models for Graph Matching
Sort
View
EGH
2004
Springer
14 years 1 months ago
Efficient partitioning of fragment shaders for multiple-output hardware
Partitioning fragment shaders into multiple rendering passes is an effective technique for virtualizing shading resource limits in graphics hardware. The Recursive Dominator Split...
Tim Foley, Mike Houston, Pat Hanrahan
ESOP
2004
Springer
14 years 3 months ago
Canonical Graph Shapes
Abstract. Graphs are an intuitive model for states of a (software) system that include pointer structures — for instance, object-oriented programs. However, a naive encoding resu...
Arend Rensink
AI
2008
Springer
13 years 10 months ago
Conditional independence and chain event graphs
Graphs provide an excellent framework for interrogating symmetric models of measurement random variables and discovering their implied conditional independence structure. However,...
Jim Q. Smith, Paul E. Anderson
SIBGRAPI
1999
IEEE
14 years 2 months ago
Deterministic Texture Analysis and Synthesis Using Tree Structure Vector Quantization
Texture analysis and synthesis is very important for computer graphics, vision, and image processing. This paper describes an algorithm which can produce new textures with a matchi...
Li-Yi Wei
SIGGRAPH
1995
ACM
14 years 1 months ago
Pyramid-based texture analysis/synthesis
This paper describes a method for synthesizing images that match the texture appearanceof a given digitized sample. This synthesisis completely automatic and requires only the “...
David J. Heeger, James R. Bergen