Sciweavers

2519 search results - page 381 / 504
» Martingales and Locality in Distributed Computing
Sort
View
UAI
1996
13 years 11 months ago
Learning Equivalence Classes of Bayesian Network Structures
Two Bayesian-network structures are said to be equivalent if the set of distributions that can be represented with one of those structures is identical to the set of distributions...
David Maxwell Chickering
FTTCS
2006
132views more  FTTCS 2006»
13 years 10 months ago
Algorithms and Data Structures for External Memory
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
Jeffrey Scott Vitter
CN
2007
154views more  CN 2007»
13 years 10 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
DKE
2007
131views more  DKE 2007»
13 years 10 months ago
Reasoning and change management in modular ontologies
ct 9 The benefits of modular representations are well known from many areas of computer science. While in software engi10 neering modularization is mainly a vehicle for supporting...
Heiner Stuckenschmidt, Michel C. A. Klein
CCR
2002
111views more  CCR 2002»
13 years 10 months ago
A taxonomy and design considerations for Internet accounting
Economic principles are increasingly being suggested for addressing some complex issues related to distributed resource allocation for QoS (Quality of Service) enhancement. Many p...
Michel Kouadio, Udo W. Pooch