583 search results - page 72 / 117 » Computing Linking Numbers of a Filtration |
141
Voted
SPAA
2004
ACM
15 years 8 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
107
Voted
ICNP
2007
IEEE
15 years 9 months ago
2007
IEEE
— Congestion caused by a large number of interacting TCP flows at a bottleneck network link is different from that caused by a lesser number of flows sending large amounts of d...
117
Voted
BMCBI
2006
15 years 2 months ago
2006
Background: The annotations of Affymetrix DNA microarray probe sets with Gene Ontology terms are carefully selected for correctness. This results in very accurate but incomplete a...
137
Voted
OPODIS
2010
15 years 19 days ago
2010
Abstract. Small-world networks are currently present in many distributed applications and can be built augmenting a base network with long-range links using a probability distribut...
160
Voted
CVPR
2009
IEEE
2009
IEEE
Layered Graph Matching by Composite Cluster Sampling with Collaborative and Competitive Interactions
16 years 9 months ago
This paper studies a framework for matching an unknown
number of corresponding structures in two images
(shapes), motivated by detecting objects in cluttered background
and lear...