13026 search results - page 2517 / 2606 » Probabilistic Relational Models |
148
click to vote
JCDL
2006
ACM
15 years 9 months ago
2006
ACM
In this paper we present a method of parsing unstructured textual records briefly describing a person and their direct relatives, which we use in the construction of a browsing t...
162
click to vote
PODC
2006
ACM
15 years 9 months ago
2006
ACM
Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of informatio...
127
click to vote
SIGCOMM
2006
ACM
15 years 9 months ago
2006
ACM
A pervasive requirement of distributed systems is to deal with churn — change in the set of participating nodes due to joins, graceful leaves, and failures. A high churn rate ca...
127
click to vote
SIGMETRICS
2006
ACM
15 years 9 months ago
2006
ACM
In this paper, we investigate the suitability of embedding Internet hosts into a Euclidean space given their pairwise distances (as measured by round-trip time). Using the classic...
128
click to vote
SIGMETRICS
2006
ACM
15 years 9 months ago
2006
ACM
We consider a system with two service classes with heterogeneous traffic characteristics and Quality-of-Service requirements. The available bandwidth is shared between the two tra...