2124 search results - page 342 / 425 » Repairing Structurally Complex Data |
CF
2004
ACM
14 years 2 months ago
2004
ACM
Many parallel applications from scientific computing use MPI global communication operations to collect or distribute data. Since the execution times of these communication opera...
STOC
1996
ACM
14 years 29 days ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
VL
1993
IEEE
14 years 29 days ago
1993
IEEE
This paper presents a new programming language named SPARCL that has four major elements: it is a visual language, it is a logic programming language, it relies on sets to organiz...
SIGGRAPH
1993
ACM
14 years 27 days ago
1993
ACM
An ideal visibility algorithm should a) quickly reject most of the hidden geometry in a model and b) exploit the spatial and perhaps temporal coherence of the images being generat...
IJIG
2002
13 years 8 months ago
2002
This paper forms a continuation of our work focused on exploiting film grammar for the task of automated film understanding. We examine film rhythm, a powerful narrative concept u...