10414 search results - page 1765 / 2083 » An efficient algorithm for Co-segmentation |
147
click to vote
DEXAW
1999
IEEE
15 years 8 months ago
1999
IEEE
Objects like road networks, CAD/CAM components, electrical or electronic circuits, molecules, can be represented as graphs, in many modern applications. In this paper, we propose ...
139
Voted
FOCS
1999
IEEE
15 years 8 months ago
1999
IEEE
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
151
click to vote
HCW
1999
IEEE
15 years 8 months ago
1999
IEEE
: Networks of Workstations (NOW) have become an attractive alternative platform for high performance computing. Due to the commodity nature of workstations and interconnects and du...
142
click to vote
ICCAD
1999
IEEE
15 years 8 months ago
1999
IEEE
This paper presents a new method to synthesize timed asynchronous circuits directly from the specification without generating a state graph. The synthesis procedure begins with a ...
143
click to vote
ICDCS
1999
IEEE
15 years 8 months ago
1999
IEEE
We describe methods of identifying and exploiting sharing patterns in multi-threaded DSM applications. Active correlation tracking is used to determine the affinity, or amount of ...