Sciweavers

76 search results - page 7 / 16
» Dominance Order and Graphical Partitions
Sort
View
UAI
1996
13 years 11 months ago
A Graph-Theoretic Analysis of Information Value
We derive qualitative relationships about the informationalrelevance of variables in graphical decision models based on a consideration of the topology of the models. Speci cally,...
Kim-Leng Poh, Eric Horvitz
CASES
2010
ACM
13 years 8 months ago
Resource recycling: putting idle resources to work on a composable accelerator
Mobile computing platforms in the form of smart phones, netbooks, and personal digital assistants have become an integral part of our everyday lives. Moving ahead to the future, m...
Yongjun Park, Hyunchul Park, Scott A. Mahlke, Sukj...
SG
2005
Springer
14 years 3 months ago
Virtual Camera Planning: A Survey
Modelling, animation and rendering has dominated research computer graphics yielding increasingly rich and realistic virtual worlds. The complexity, richness and quality of the vir...
Marc Christie, Rumesh Machap, Jean-Marie Normand, ...
SMA
2008
ACM
172views Solid Modeling» more  SMA 2008»
13 years 10 months ago
Guarding curvilinear art galleries with edge or mobile guards
In this paper we consider the problem of monitoring an art gallery modeled as a polygon, the edges of which are arcs of curves. We consider two types of guards: edge guards (these...
Menelaos I. Karavelas
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
13 years 9 months ago
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
Stefan Felsner, Lorenz Wernisch