417 search results - page 48 / 84 » Generalization Bounds for Some Ordinal Regression Algorithms |
108
click to vote
TC
2002
14 years 9 months ago
2002
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lac...
111
click to vote
OPODIS
2010
14 years 7 months ago
2010
Abstract. Shared counters are the key to solving a variety of coordination problems on multiprocessor machines, such as barrier synchronization and index distribution. It is desire...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
CPM
1999
Springer
15 years 2 months ago
1999
Springer
This paper examines some of the rich structure of the syntenic distance model of evolutionary distance, introduced by Ferretti et al. (1996). The syntenic distance between two gen...
ICPP
1991
IEEE
15 years 1 months ago
1991
IEEE
There is an interesting class of ICNs, which includes the star graph and the n-way shuffle, for which the network diameter is sub-logarithmic in the network size. This paper prese...