3958 search results - page 298 / 792 » Dynamic Graph Algorithms with Applications |
182
click to vote
GRAPHICSINTERFACE
2000
15 years 8 months ago
2000
Interactive 3D applications require fast detection of objects colliding with the environment. One popular method for fast collision detection is to offset the geometry of the envi...
172
click to vote
TWC
2008
15 years 6 months ago
2008
We consider resource allocation for elastic wireless applications that measure utility by target connection average throughput and achieved throughput. We construct a framework for...
187
Voted
CVIU
2008
2008
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
15 years 6 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...
171
click to vote
RSFDGRC
2005
Springer
16 years 5 days ago
2005
Springer
In this paper, the concept of a granulation order is proposed in an information system. The positive approximation of a set under a granulation order is defined. Some properties o...
200
Voted
PDP
2005
IEEE
16 years 8 days ago
2005
IEEE
Circulant graphs have been deeply studied in technical literature. Midimew networks are a class of distancerelated optimal circulant graphs of degree four which have applications ...