3466 search results - page 351 / 694 » Fast computation of special resultants |
196
click to vote
ANSS
2002
IEEE
15 years 12 months ago
2002
IEEE
Clusters of workstations have emerged as a costeffective solution to high performance computing problem. To take advantage of any opportunities, however, effective scheduling tech...
181
click to vote
STACS
2009
Springer
15 years 11 months ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
149
click to vote
EUROPAR
2001
Springer
15 years 11 months ago
2001
Springer
We present randomized and deterministic algorithms for many-to-one routing on an n-node two-dimensional mesh under the store-and-forward model of packet routing. We consider the g...
169
click to vote
ICC
2000
IEEE
15 years 11 months ago
2000
IEEE
— Server responsiveness and scalability are more important than ever in today’s client/server dominated network environments. Recently, researchers have begun to consider clust...
141
click to vote
ICPR
2000
IEEE
15 years 11 months ago
2000
IEEE
The navigational tasks of computingtime-to-impact and controlling movements within specific range are addressed here. By using specially designed lenses various components of thes...