2127 search results - page 336 / 426 » Computing large matchings fast |
137
Voted
IWCMC
2010
ACM
15 years 10 months ago
2010
ACM
We describe a general-purpose distributed system capable of traceback of malicious flow trajectories in the wide area despite possible source IP spoofing. Our system requires th...
165
click to vote
ICPADS
2002
IEEE
15 years 10 months ago
2002
IEEE
Nowadays, the commonly used table lookup scheme for IP routing is based on the so-called classless interdomain routing (CIDR). With CIDR, routers must find out the best matching ...
172
click to vote
PPOPP
1999
ACM
15 years 10 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
162
click to vote
ICCV
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper presents an e cient shape-based object detection method based on Distance Transforms and describes its use for real-time vision on-board vehicles. The method uses a tem...
162
click to vote
MICRO
1998
IEEE
15 years 9 months ago
1998
IEEE
Media applications are characterized by large amounts of available parallelism, little data reuse, and a high computation to memory access ratio. While these characteristics are p...