1074 search results - page 130 / 215 » An ASM-Characterization of a Class of Distributed Algorithms |
161
click to vote
NIPS
2007
15 years 8 months ago
2007
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
196
click to vote
TON
1998
15 years 6 months ago
1998
— The configuration of virtual path (VP) connection services is expected to play an important role in the operation of large-scale asynchronous transfer mode (ATM) networks. A m...
174
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
Massive-scale self-administered networks like Peer-to-Peer and Sensor Networks have data distributed across thousands of participant hosts. These networks are highly dynamic with ...
210
click to vote
JCB
2002
15 years 6 months ago
2002
For small samples, classi er design algorithms typically suffer from over tting. Given a set of features, a classi er must be designed and its error estimated. For small samples, ...
180
click to vote
SOFSEM
2000
Springer
15 years 10 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...