1515 search results - page 100 / 303 » Parallel computing on any desktop |
136
click to vote
SKG
2006
IEEE
15 years 9 months ago
2006
IEEE
Semantic completeness and syntax completeness are important characters of the general formal systems, two the completeness have different meaning for a formal system. This paper a...
111
Voted
CW
2002
IEEE
15 years 8 months ago
2002
IEEE
This paper addresses interactive function-based shape modeling where relatively small formulas are used rather than thousands of polygons. Interactive modification of the function...
132
click to vote
IPPS
1999
IEEE
15 years 7 months ago
1999
IEEE
This paper proposes a method for reducing the maximum degree of vertices in graphs that maintain optimal broadcast time when a vertex can call a vertex at distance at most k durin...
128
click to vote
IPPS
1999
IEEE
15 years 7 months ago
1999
IEEE
We present an optimal and scalable permutation routing algorithm for three reconfigurable models based on linear arrays that allow pipelining of information through an optical bus...
130
click to vote
IPPS
1997
IEEE
15 years 7 months ago
1997
IEEE
In this paper, we present adaptive fault-tolerant deadlock-free routing algorithms for hypercubes and meshes by using only 3 virtual channels and 2 virtual channels respectively. ...