207 search results - page 38 / 42 » ideas 1999 |
102
click to vote
FOCS
1999
IEEE
15 years 2 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
68
Voted
SIGCOMM
1999
ACM
15 years 2 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...
86
Voted
SIGMOD
1999
ACM
15 years 2 months ago
1999
ACM
It is envisaged that the application of the multilevel security (MLS) scheme will enhance exibility and e ectiveness of authorization policies in shared enterprise databases and w...
80
Voted
HPDC
1999
IEEE
15 years 2 months ago
1999
IEEE
Efficient and robust metacomputing requires the decomposition of complex jobs into tasks that must be scheduled on distributed processing nodes. There are various ways of creating...
ICDCS
1999
IEEE
15 years 2 months ago
1999
IEEE
Update anywhere-anytime-anyway transactional replication has unstable behavior as the workload scales up. To reduce this problem, a two-tier replication algorithm is proposed in [...