Sciweavers

176 search results - page 29 / 36
» On Directed Triangles in Digraphs
Sort
View
NHM
2010
87views more  NHM 2010»
13 years 2 months ago
The coolest path problem
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Martin Frank, Armin Fügenschuh, Michael Herty...
VLDB
2004
ACM
106views Database» more  VLDB 2004»
14 years 23 days ago
On The Marriage of Lp-norms and Edit Distance
Existing studies on time series are based on two categories of distance functions. The first category consists of the Lp-norms. They are metric distance functions but cannot supp...
Lei Chen 0002, Raymond T. Ng
SIGGRAPH
1999
ACM
13 years 11 months ago
Multiresolution Mesh Morphing
We present a new method for user controlled morphing of two homeomorphic triangle meshes of arbitrary topology. In particular we focus on the problem of establishing a corresponde...
Aaron W. F. Lee, David P. Dobkin, Wim Sweldens, Pe...
BMCBI
2005
95views more  BMCBI 2005»
13 years 7 months ago
Commensurate distances and similar motifs in genetic congruence and protein interaction networks in yeast
Background: In a genetic interaction, the phenotype of a double mutant differs from the combined phenotypes of the underlying single mutants. When the single mutants have no growt...
Ping Ye, Brian D. Peyser, Forrest A. Spencer, Joel...
CORR
2011
Springer
191views Education» more  CORR 2011»
13 years 2 months ago
On Approximating Four Covering and Packing Problems
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of th...
Mary V. Ashley, Tanya Y. Berger-Wolf, Piotr Berman...