470 search results - page 72 / 94 » Local properties of geometric graphs |
CVIU
2008
2008
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
13 years 7 months ago
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
DIALM
2003
ACM
14 years 24 days ago
2003
ACM
This paper addresses the problem of scatternet formation for singlehop Bluetooth based ad hoc networks, with minimal communication overhead. We adopt the well-known structure de B...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—This paper presents Respondent-Driven Sampling (RDS) as a promising technique to derive unbiased estimates of node properties in unstructured overlay networks such as Gnutella. ...
ECCC
2008
13 years 7 months ago
2008
Given a function f : {0, 1}n {0, 1}, let M (f) denote the smallest distance between f and a monotone function on {0, 1}n . Let M (f) denote the fraction of hypercube edges where f...
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...