Sciweavers

137 search results - page 19 / 28
» Locally connected spanning trees on graphs
Sort
View
ICCCN
2008
IEEE
15 years 4 months ago
TRACK: A Novel Connected Dominating Set based Sink Mobility Model for WSNs
—The core functionality of a wireless sensor network (WSN) is to detect deviations in expected normal behavior and report it to the sink. In this paper, we propose TRACK — a no...
Avinash Srinivasan, Jie Wu
CVPR
2011
IEEE
14 years 5 months ago
Nonparametric Density Estimation on A Graph: Learning Framework, Fast Approximation and Application in Image Segmentation
We present a novel framework for tree-structure embedded density estimation and its fast approximation for mode seeking. The proposed method could find diverse applications in co...
Zhiding Yu, Oscar Au, Ketan Tang
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
15 years 9 months ago
Fully-dynamic min-cut
We show that we can maintain up to polylogarithmic edge connectivity for a fully-dynamic graph in ~O(pn) time per edge insertion or deletion. Within logarithmic factors, this matc...
Mikkel Thorup
DIAGRAMS
2004
Springer
15 years 2 months ago
Drawing Graphs in Euler Diagrams
We describe a method for drawing graph-enhanced Euler diagrams using a three stage method. The first stage is to lay out the underlying Euler diagram using a multicriteria optimizi...
Paul Mutton, Peter Rodgers, Jean Flower
CPAIOR
2010
Springer
15 years 2 months ago
Constraint-Based Local Search for Constrained Optimum Paths Problems
Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algo...
Pham Quang Dung, Yves Deville, Pascal Van Hentenry...