17760 search results - page 220 / 3552 » A Generalization of the Massey-Ding Algorithm |
156
click to vote
ISCC
2000
IEEE
15 years 10 months ago
2000
IEEE
In this paper we propose a novel late join algorithm for distributed applications with a fully replicated architecture (e.g. shared whiteboards). The term `late join algorithm'...
182
click to vote
SMA
1995
ACM
15 years 10 months ago
1995
ACM
: Fast and accurate collision detection between general solid models is a fundamental problem in solid modeling, robotics, animation and computer-simulated environments. Most of th...
180
click to vote
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract-- This paper studies distributed coordination algorithms for multiple fractional-order systems over a directed communication graph. A general fractional-order consensus mo...
172
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
146
click to vote
ICCAD
2002
IEEE
16 years 3 months ago
2002
IEEE
This paper presents an in-depth study of the theory and algorithms for the SPFD-based (Set of Pairs of Functions to be Distinguished) rewiring, and explores the flexibility in the...