Sciweavers

935 search results - page 59 / 187
» The directional p
Sort
View
CPC
2011
219views Education» more  CPC 2011»
14 years 6 months ago
On Percolation and the Bunkbed Conjecture
We study a problem on edge percolation on product graphs G× K2. Here G is any finite graph and K2 consists of two vertices {0, 1} connected by an edge. Every edge in G × K2 is p...
Svante Linusson
CAD
2006
Springer
14 years 12 months ago
Automatic least-squares projection of points onto point clouds with applications in reverse engineering
A novel method for projecting points onto a point cloud, possibly with noise, is presented based on the point directed projection (DP) algorithm proposed by Azariadis P., Sapidis ...
Yu-Shen Liu, Jean-Claude Paul, Jun-Hai Yong, Pi-Qi...
BMCBI
2007
157views more  BMCBI 2007»
14 years 12 months ago
Improving gene set analysis of microarray data by SAM-GS
Background: Gene-set analysis evaluates the expression of biological pathways, or a priori defined gene sets, rather than that of individual genes, in association with a binary ph...
Irina Dinu, John D. Potter, Thomas Mueller, Qi Liu...
MFCS
2004
Springer
15 years 5 months ago
Generating Paths and Cuts in Multi-pole (Di)graphs
Let G = (V, E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of (source-sink) pairs of vertices of G, an important problem that arises in the computat...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
COMBINATORICS
2006
107views more  COMBINATORICS 2006»
14 years 12 months ago
A Note on the Number of Hamiltonian Paths in Strong Tournaments
We prove that the minimum number of distinct hamiltonian paths in a strong tournament of order n is 5 n-1 3 . A known construction shows this number is best possible when n 1 mod...
Arthur H. Busch