3092 search results - page 500 / 619 » Where are you pointing |
151
click to vote
SIGCOMM
1999
ACM
15 years 10 months ago
1999
ACM
We suggest a new simple forwarding technique to speed-up IP destination address lookup. The technique is a natural extension of IP, requires 5 bits in the IP header (IPv4, 7 in IP...
129
click to vote
FOCS
1993
IEEE
15 years 10 months ago
1993
IEEE
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
170
click to vote
COMPGEOM
1992
ACM
15 years 10 months ago
1992
ACM
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
185
click to vote
WADS
1993
Springer
15 years 10 months ago
1993
Springer
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
203
click to vote
AOSD
2009
ACM
15 years 10 months ago
2009
ACM
Some security concerns are sensitive to flow of information in a program execution. The dataflow pointcut has been proposed by Masuhara and Kawauchi in order to easily implement s...