2085 search results - page 362 / 417 » Special interest groups |
106
click to vote
COLT
1999
Springer
15 years 4 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
ESA
1999
Springer
15 years 4 months ago
1999
Springer
This paper deals with the on-line allocation of shared data objects to the local memory modules of the nodes in a network. We assume that the data is organized in indivisible objec...
152
Voted
VLDB
1999
ACM
15 years 4 months ago
1999
ACM
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
141
click to vote
ICALP
1998
Springer
15 years 4 months ago
1998
Springer
Interval Routing Schemes (IRS for short) have been extensively investigated in the past years with special emphasis on shortest paths. Besides their theoretical interest, IRS have...
115
Voted
SIGDOC
1997
ACM
15 years 4 months ago
1997
ACM
This paper describes the strengths and weaknesses of two usability assessment methods frequently applied to web sites. It uses case histories of WWW usability studies conducted by...