10414 search results - page 1786 / 2083 » An efficient algorithm for Co-segmentation |
134
click to vote
CCGRID
2001
IEEE
15 years 7 months ago
2001
IEEE
Global Computing achieves high throughput computing by harvesting a very large number of unused computing resources connected to the Internet. This parallel computing model target...
125
click to vote
COMPGEOM
2001
ACM
15 years 7 months ago
2001
ACM
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
147
click to vote
FMCAD
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. We consider the problem of refinement checking for asynchronous processes where refinement corresponds to stutter-closed language inclusion. Since an efficient algorithmi...
141
click to vote
FMCAD
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. This paper presents a scalable method for parallel symbolic on-the-fly model checking in a distributed memory environment. Our method combines a scheme for on-the-fly mod...
166
click to vote
FPGA
2000
ACM
15 years 7 months ago
2000
ACM
A method for evaluating and constructing sparse crossbars which are both area efficient and highly routable is presented. The evaluation method uses a network flow algorithm to ac...