1291 search results - page 161 / 259 » Computing the multiplicity structure in solving polynomial s... |
103
click to vote
NETWORKING
2000
15 years 3 months ago
2000
Abstract. We examine the fair allocation of capacity to a large population of best-effort connections in a typical multiple access communication system supporting some bandwidth on...
CCS
2009
ACM
15 years 8 months ago
2009
ACM
Modern computer systems permit users to access protected information from remote locations. In certain secure environments, it would be desirable to restrict this access to a part...
104
Voted
HPDC
1998
IEEE
15 years 5 months ago
1998
IEEE
One of the most difficult problems to be solved by metacomputing systems is to ensure strong authentication and authorization. The problem is complicated since the hosts involved ...
120
click to vote
ICVS
2009
Springer
14 years 11 months ago
2009
Springer
This paper introduces a system that automatically classifies registration problems based on the type of registration required. Rather than rely on a single "best" algorit...
103
click to vote
COLT
1997
Springer
15 years 5 months ago
1997
Springer
We relate two problems that have been explored in two distinct communities. The first is the problem of combining expert advice, studied extensively in the computational learning...