2498 search results - page 222 / 500 » Algorithms for the Topological Watershed |
171
click to vote
SBACPAD
2008
IEEE
16 years 1 months ago
2008
IEEE
The development of grid algorithms is frequently hampered by limited means to describe topologies and lack of support for the invasive composition of legacy components in order to...
191
click to vote
GLOBECOM
2007
IEEE
16 years 29 days ago
2007
IEEE
Abstract— High-throughput P2P streaming relies on peer selection, the strategy a peer uses to select other peer(s) as its parent(s) of streaming. Although this problem has been t...
170
click to vote
RTCSA
2007
IEEE
16 years 27 days ago
2007
IEEE
An important property in a sensor network is the monitoring of temporal changes of hazardous situations such as forest fires. Rescue groups need to be aware of dynamic changes th...
195
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
161
click to vote
CVGIP
2004
15 years 6 months ago
2004
In this paper, we propose the utilization of a kd-tree based hierarchy as an implicit object representation. Compared to an octree, the kd-tree based hierarchy is superior in term...