Sciweavers

71 search results - page 9 / 15
» Coxeter Lattice Paths
Sort
View
COMPSAC
2003
IEEE
15 years 2 months ago
A Cut-Based Algorithm for Reliability Analysis of Terminal-Pair Network Using OBDD
In this paper, we propose an algorithm to construct the Ordered Binary Decision Diagram (OBDD) representing the cut function of a terminal-pair network. The algorithm recognizes i...
Yung-Ruei Chang, Hung-Yau Lin, Ing-Yi Chen, Sy-Yen...
MFCS
2000
Springer
15 years 1 months ago
On the Use of Duality and Geometry in Layouts for ATM Networks
Abstract. We show how duality properties and geometric considerations are used in studies related to virtual path layouts of ATM networks. We concentrate on the one-to-many problem...
Shmuel Zaks
PAMI
2010
222views more  PAMI 2010»
14 years 8 months ago
Minimal Surfaces Extend Shortest Path Segmentation Methods to 3D
—Shortest paths have been used to segment object boundaries with both continuous and discrete image models. Although these techniques are well defined in 2D, the character of the...
Leo Grady
AROBOTS
2007
81views more  AROBOTS 2007»
14 years 9 months ago
Mobile robot team forming for crystallization of proteins
The process of protein crystallization is explained using the theory of robotics, particularly path planning of mobile robots. Path planning is a procedure which specifies motion ...
Yuan F. Zheng, Weidong Chen
73
Voted
JCT
2006
60views more  JCT 2006»
14 years 9 months ago
Alternating sign matrices with one -1 under vertical reflection
We define a bijection that transforms an alternating sign matrix A with one -1 into a pair (N, E) where N is a (so called) neutral alternating sign matrix (with one -1) and E is an...
Pierre Lalonde