Results 1  10
of
75
Families of Maximal Snakes of Length 2(d+1)
"... In this paper study of maximal induced paths (also known as maximal snakes) has been used as an approach to solve the problem of nding the longest snakes in hypercubes. In this connection, we show the existence of families of maximal dsnakes of length 2(d + 1). It is a hope that this approach w ..."
Abstract
 Add to MetaCart
In this paper study of maximal induced paths (also known as maximal snakes) has been used as an approach to solve the problem of nding the longest snakes in hypercubes. In this connection, we show the existence of families of maximal dsnakes of length 2(d + 1). It is a hope that this approach
Existence of Maximal Snakes of Length 2 (d+2)
"... In this paper, the study of maximal induced paths (also known as maximal snakes) has been used as an approach to solve the problem of nding the longest snakes in hypercubes. In this connection, we show the existence of maximal dsnakes of length 2(d+2). It is a hope that this approach will resul ..."
Abstract
 Add to MetaCart
In this paper, the study of maximal induced paths (also known as maximal snakes) has been used as an approach to solve the problem of nding the longest snakes in hypercubes. In this connection, we show the existence of maximal dsnakes of length 2(d+2). It is a hope that this approach
Using PVM to Hunt Maximal Snakes in Hypercubes
"... Currently, exhaustive search is the only known method for finding longest induced paths in hypercubes. Based on empirical data we conjecture that extending suitable maximal, but not necessarily longest, snakes in an ndimensional hypercube is a tractable alternative for generating longest snakes ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Currently, exhaustive search is the only known method for finding longest induced paths in hypercubes. Based on empirical data we conjecture that extending suitable maximal, but not necessarily longest, snakes in an ndimensional hypercube is a tractable alternative for generating longest
Maximal and Reversible Snakes in Hypercubes
, 1999
"... this paper we address two of these possibilities that seem the most promising. Neither of the two approaches we mention below have been studied in the literature ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
this paper we address two of these possibilities that seem the most promising. Neither of the two approaches we mention below have been studied in the literature
Diffusion snakes: introducing statistical shape knowledge into the MumfordShah functional
 J. OF COMPUTER VISION
, 2002
"... We present a modification of the MumfordShah functional and its cartoon limit which facilitates the incorporation of a statistical prior on the shape of the segmenting contour. By minimizing a single energy functional, we obtain a segmentation process which maximizes both the grey value homogeneit ..."
Abstract

Cited by 130 (16 self)
 Add to MetaCart
We present a modification of the MumfordShah functional and its cartoon limit which facilitates the incorporation of a statistical prior on the shape of the segmenting contour. By minimizing a single energy functional, we obtain a segmentation process which maximizes both the grey value
Maximal FacettoFacet Snakes of Unit Cubes
"... Let C = hC 1 ; C 2 ; : : : ; C n i be a finite sequence of unit cubes in the ddimensional space. The sequence C is called a facettofacet snake if C i " C i+1 is a common facet of C i and C i+1 , 1 i n \Gamma 1, and dim(C i " C j ) maxf\Gamma1; d + i \Gamma jg, 1 i ! j n. A facet ..."
Abstract
 Add to MetaCart
facettofacet snake of unit cubes is called maximal if it is not a proper subset of another facettofacet snake of unit cubes. In this paper we prove that the minimum number of ddimensional unit cubes which can form a maximal facettofacet snake is 8d \Gamma 1 for all d 3.
Maximal FacettoFacet Snakes of Unit Cubes
, 2001
"... Let C = hC 1 ; C 2 ; : : : ; C n i be a nite sequence of unit cubes in the d dimensional space. The sequence C is called a facettofacet snake if C i \ C i+1 is a common facet of C i and C i+1 , 1 i n 1, and dim(C i \C j ) maxf1; d+i jg, 1 i < j n. A facettofacet snake of unit cubes i ..."
Abstract
 Add to MetaCart
is called maximal if it is not a proper subset of another facettofacet snake of unit cubes. In this paper we prove that the minimum number of ddimensional unit cubes which can form a maximal facettofacet snake is 8d 1 for all d 3.
Maximal FacettoFacet Snakes of Unit Cubes
"... Abstract. Let C = 〈C1, C2,..., Cn 〉 be a finite sequence of unit cubes in the ddimensional space. The sequence C is called a facettofacet snake if Ci ∩ Ci+1 is a common facet of Ci and Ci+1, 1 ≤ i ≤ n−1, and dim(Ci∩Cj) ≤ max{−1, d+i−j}, 1 ≤ i < j ≤ n. A facettofacet snake of unit cubes is c ..."
Abstract
 Add to MetaCart
is called maximal if it is not a proper subset of another facettofacet snake of unit cubes. In this paper we prove that the minimum number of ddimensional unit cubes which can form a maximal facettofacet snake is 8d − 1 for all d ≥ 3. 1.
Snakes with ellipsereproducing properties
 IEEE Transactions on Image Processing, in press, doi:10.1109/TIP.2011.2169975
, 2011
"... Abstract—We present a new class of continuously defined parametric snakes using a special kind of exponential splines as basis functions. We have enforced our bases to have the shortest possible support subject to some design constraints to maximize efficiency. While the resulting snakes are versati ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
Abstract—We present a new class of continuously defined parametric snakes using a special kind of exponential splines as basis functions. We have enforced our bases to have the shortest possible support subject to some design constraints to maximize efficiency. While the resulting snakes
INDIGENOUS SNAKE BITE REMEDIES OF THE LUO OF
"... research funders in the common goal of maximizing access to critical research. ..."
Abstract
 Add to MetaCart
research funders in the common goal of maximizing access to critical research.
Results 1  10
of
75