182 search results - page 15 / 37 » Infinite Possibilities |
DM
2008
13 years 7 months ago
2008
A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v1, . . . , vk of G, there exists a cycle (respectively, a hamilton...
AICOM
2004
13 years 7 months ago
2004
The paper abstracts the contents of a PhD dissertation entitled A Generic, Collaborative Framework for Interval Constraint Solving which has been recently defended. This thesis pre...
TIT
2002
13 years 7 months ago
2002
Let ( ) denote the maximum possible number of codewords in a binary code of length and minimum Hamming distance . For large values of , the best known upper bound, for fixed , is t...
IFIPTCS
2010
13 years 5 months ago
2010
Abstract. We investigate systematically into the various possible notions of traceable sets and the relations they bear to each other and to other notions such as diagonally noncom...
ICRA
2010
IEEE
13 years 5 months ago
2010
IEEE
This paper presents a new needle path planning method for digital breast tomosynthesis biopsy. Needle insertion planning into deformable tissue for breast biopsy procedure is a cha...