Sciweavers

4865 search results - page 459 / 973
» The Complexity of Graph Connectivity
Sort
View
TVLSI
2002
161views more  TVLSI 2002»
15 years 6 months ago
Arbitrarily shaped rectilinear module placement using the transitive closure graph representation
In this paper, we deal with arbitrarily shaped rectilinear module placement using the transitive closure graph (TCG) representation. The geometric meanings of modules are transpare...
Jai-Ming Lin, Hsin-Lung Chen, Yao-Wen Chang
IV
2003
IEEE
92views Visualization» more  IV 2003»
16 years 6 days ago
A Visual Formalism for Graphical User Interfaces based on State Transition Diagrams
In this paper we present a “lightweight” visual formalism that can be used to examine the state space complexity of an interface. The method can form a basis for designing, te...
Carsten Maple, Tim French, Marc Conrad
CVPR
2005
IEEE
16 years 9 months ago
Dense Photometric Stereo Using a Mirror Sphere and Graph Cut
We present a surprisingly simple system that allows for robust normal reconstruction by dense photometric stereo, in the presence of severe shadows, highlight, transparencies, com...
Tai-Pang Wu, Chi-Keung Tang
ICDE
2001
IEEE
159views Database» more  ICDE 2001»
16 years 8 months ago
Workflow and Process Synchronization with Interaction Expressions and Graphs
Current workflow management technology does not provide adequate means for inter-workflow coordination as concurrently executing workflows are considered completely independent. W...
Christian Heinlein
CP
2009
Springer
16 years 7 months ago
Constraint-Based Optimal Testing Using DNNF Graphs
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
Anika Schumann, Martin Sachenbacher, Jinbo Huang