310 search results - page 43 / 62 » Cutting two graphs simultaneously |
CAD
2008
Springer
13 years 10 months ago
2008
Springer
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...
INFOVIS
1999
IEEE
14 years 2 months ago
1999
IEEE
A new method is presented to get insight into univariate time series data. The problem addressed here is how to identify patterns and trends on multiple time scales (days, weeks, ...
CVPR
2005
IEEE
15 years 8 days ago
2005
IEEE
This paper describes two algorithms capable of real-time segmentation of foreground from background layers in stereo video sequences. Automatic separation of layers from colour/co...
CC
1998
Springer
13 years 10 months ago
1998
Springer
Graph coloring is the dominant paradigm for global register allocation [8, 7, 4]. Coloring allocators use an interference graph, Z, to model conflicts that prevent two values from ...
PAMI
2007
13 years 9 months ago
2007
This paper exploits the properties of the commute time between nodes of a graph for the purposes of clustering and embedding, and explores its applications to image segmentation a...