Sciweavers

779 search results - page 118 / 156
» Ranking distributed probabilistic data
Sort
View
COLT
1992
Springer
15 years 3 months ago
Language Learning from Stochastic Input
Language learning from positive data in the Gold model of inductive inference is investigated in a setting where the data can be modeled as a stochastic process. Specifically, the...
Shyam Kapur, Gianfranco Bilardi
SDM
2010
SIAM
158views Data Mining» more  SDM 2010»
15 years 1 months ago
On the Use of Combining Rules in Relational Probability Trees
A relational probability tree (RPT) is a type of decision tree that can be used for probabilistic classification of instances with a relational structure. Each leaf of an RPT cont...
Daan Fierens
JPDC
2008
122views more  JPDC 2008»
14 years 11 months ago
Stochastic robustness metric and its use for static resource allocations
This research investigates the problem of robust static resource allocation for distributed computing systems operating under imposed Quality of Service (QoS) constraints. Often, ...
Vladimir Shestak, Jay Smith, Anthony A. Maciejewsk...
ICON
2007
IEEE
15 years 6 months ago
Myth: An Accurate and Scalable Network Coordinate System under High Node Churn Rate
—Network coordinate (NC) system is an efficient mechanism to predict Internet distance (latency) with limited times of measurement. In this paper, we focus on the node churn pro...
Yang Chen, Genyi Zhao, Ang Li, Beixing Deng, Xing ...
IPPS
2005
IEEE
15 years 5 months ago
An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors (SMPs)
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...
Guojing Cong, David A. Bader