1120 search results - page 77 / 224 » time 1999 |
106
click to vote
COLT
1999
Springer
15 years 3 months ago
1999
Springer
We propose a new boosting algorithm. This boosting algorithm is an adaptive version of the boost by majority algorithm and combines bounded goals of the boost by majority algorith...
PKC
1999
Springer
15 years 3 months ago
1999
Springer
This paper introduces a method for tracking different copies of functionally equivalent algorithms containing identification marks known to the attacker. Unlike all previous solu...
VLDB
1999
ACM
15 years 3 months ago
1999
ACM
The problem of nding the best answers to a query quickly, rather than nding all answers, is of increasing importance as relational databases are applied in multimedia and decision...
81
Voted
ICDCS
1999
IEEE
15 years 3 months ago
1999
IEEE
We describe imprecise calendars, a way to organize and schedule clusters of nodes in a computation grid. Imprecise calendars permit the easy and efficient sharing of resources bet...
72
Voted
EDCC
1999
Springer
15 years 3 months ago
1999
Springer
Abstract. The paper presents a new approach to transparent BIST for wordoriented RAMs which is based on the transformation of March transparent test algorithms to the symmetric ver...