6138 search results - page 873 / 1228 » High performance computing through parallel processing |
195
click to vote
SIGCOMM
2003
ACM
16 years 1 days ago
2003
ACM
This paper presents an algorithm for content-based forwarding, an essential function in content-based networking. Unlike in traditional address-based unicast or multicast networks...
186
click to vote
SIGGRAPH
1996
ACM
15 years 11 months ago
1996
ACM
We present an algorithm for real-time level of detail reduction and display of high-complexity polygonal surface data. The algorithm uses a compact and efficient regular grid repr...
197
click to vote
TDSC
2011
15 years 1 months ago
2011
— Randomized agreement protocols have been around for more than two decades. Often assumed to be inefficient due to their high expected communication and computation complexitie...
231
click to vote
HPDC
2010
IEEE
15 years 7 months ago
2010
IEEE
Voluntary Computing systems or Desktop Grids (DGs) enable sharing of commodity computing resources across the globe and have gained tremendous popularity among scientific research...
223
click to vote
FOCS
1998
IEEE
15 years 11 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...