5448 search results - page 388 / 1090 » Breakpoints and Time in Distributed Computations |
196
click to vote
ICCV
1999
IEEE
16 years 8 months ago
1999
IEEE
We propose a Bayesian framework for representing and recognizing local image motion in terms of two primitive models: translation and motion discontinuity. Motion discontinuities ...
133
click to vote
ICDCS
2003
IEEE
16 years 1 days ago
2003
IEEE
We introduce the hash history mechanism for capturing dependencies among distributed replicas. Hash histories, consisting of a directed graph of version hashes, are independent of...
187
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
The known fast sequential algorithms for multiplying two N N matrices (over an arbitrary ring) have time complexity ON , where 2 3. The current best value of is less than 2.3755....
193
click to vote
ICDCS
1998
IEEE
15 years 11 months ago
1998
IEEE
We address the problem of efficient circuit switching in wide area networks. The solution provided is based on finding optimal routes for lightpaths and semilightpaths. A lightpat...
196
click to vote
CLUSTER
2000
IEEE
15 years 6 months ago
2000
IEEE
Clusters of workstations and networked parallel computing systems are emerging as promising computational platforms for HPC applications. The processors in such systems are typica...