6365 search results - page 191 / 1273 » Fast Local Computation Algorithms |
164
click to vote
ICC
2007
IEEE
16 years 17 days ago
2007
IEEE
— Existing methods for local area service discovery either don’t scale or rely on a trustworthy directory server; in some environments these restrictions are unacceptable or im...
161
click to vote
CC
2003
Springer
15 years 11 months ago
2003
Springer
Cache memories were invented to decouple fast processors from slow memories. However, this decoupling is only partial, and many researchers have attempted to improve cache use by p...
154
click to vote
FORTE
2004
15 years 7 months ago
2004
Abstract. We present automated techniques for the explanation of counterexamples, where a counter-example should be understood as a sequence of program statements. Our approach is ...
163
click to vote
SIGCOMM
1996
ACM
15 years 10 months ago
1996
ACM
Wormhole routing LANs are emerging as an effective solution for high-bandwidth, low-latency interconnects in distributed computing and cluster computing applications. An important...
148
click to vote
ICPR
2000
IEEE
16 years 7 months ago
2000
IEEE
A new robust dense matching algorithm is introduced in this paper. The algorithm starts from matching the most textured points, then a match propagation algorithm is developed wit...