Sciweavers

1133 search results - page 65 / 227
» Basics of Graph Cuts
Sort
View
HPCC
2007
Springer
14 years 4 months ago
Quantification of Cut Sequence Set for Fault Tree Analysis
A new evaluation method is presented that employs cut sequence set (CSS) to analyze fault trees. A cut sequence is a set of basic events that fail in a specific order that can indu...
Dong Liu, Chunyuan Zhang, Weiyan Xing, Rui Li, Hai...
VISUALIZATION
1995
IEEE
14 years 1 months ago
Automatic Generation of Triangular Irregular Networks Using Greedy Cuts
We propose a new approach to the automatic generation of triangular irregular networks from dense terrain models. We have developed and implemented an algorithm based on the greed...
Cláudio T. Silva, Joseph S. B. Mitchell, Ar...
ICPR
2008
IEEE
14 years 4 months ago
An approximate algorithm for median graph computation using graph embedding
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for ins...
Miquel Ferrer, Ernest Valveny, Francesc Serratosa,...
CIG
2005
IEEE
14 years 3 months ago
Pared-down Poker: Cutting to the Core of Command and Control
Poker poses cognitive challenges like those of warfare, business and other real world domains. This makes poker a good test bed for basic research on how people make Command and Co...
Kevin Burns
SMI
2003
IEEE
188views Image Analysis» more  SMI 2003»
14 years 3 months ago
On Graph Partitioning, Spectral Analysis, and Digital Mesh Processing
Partitioning is a fundamental operation on graphs. In this paper we briefly review the basic concepts of graph partitioning and its relationship to digital mesh processing. We als...
Craig Gotsman