1358 search results - page 226 / 272 » Proceedings |
WDAG
1990
Springer
15 years 4 months ago
1990
Springer
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
99
Voted
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
A data structure is presented for the Mergeable Dictionary abstract data type, which supports the following operations on a collection of disjoint sets of totally ordered data: Pr...
97
Voted
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
We describe an efficient technique to weigh word-based features in binary classification tasks and show that it significantly improves classification accuracy on a range of proble...
121
click to vote
ELPUB
2007
ACM
15 years 4 months ago
2007
ACM
A proposal is presented for a standard ontology language defined as ElPub/SciX Ontology, based on the content of a web digital library of conference proceedings. This content, i.e...
107
Voted
PODC
2010
ACM
15 years 4 months ago
2010
ACM
We study Reader-Writer Exclusion [1], a well-known variant of the Mutual Exclusion problem [2] where processes are divided into two classes–readers and writers–and multiple re...