Sciweavers

889 search results - page 170 / 178
» Observational Learning in Random Networks
Sort
View
JMLR
2010
134views more  JMLR 2010»
13 years 2 months ago
Inference of Graphical Causal Models: Representing the Meaningful Information of Probability Distributions
This paper studies the feasibility and interpretation of learning the causal structure from observational data with the principles behind the Kolmogorov Minimal Sufficient Statist...
Jan Lemeire, Kris Steenhaut
IJCNN
2007
IEEE
14 years 2 months ago
Generalised Kernel Machines
Abstract— The generalised linear model (GLM) is the standard approach in classical statistics for regression tasks where it is appropriate to measure the data misfit using a lik...
Gavin C. Cawley, Gareth J. Janacek, Nicola L. C. T...
INFOCOM
2009
IEEE
14 years 2 months ago
Distributed Opportunistic Scheduling With Two-Level Channel Probing
Distributed opportunistic scheduling (DOS) is studied for wireless ad-hoc networks in which many links contend for the channel using random access before data transmissions. Simpl...
P. S. Chandrashekhar Thejaswi, Junshan Zhang, Man-...
IWANN
2007
Springer
14 years 1 months ago
Towards the Integration of a Bioprofile in Ocular Melanoma
Approximately 50% of all patients with intraocular melanoma die of metastatic disease, despite successful treatment of the primary tumour. The main factors associated with mortalit...
Azzam F. Taktak, Antonio Eleuteri, Christian Setzk...
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
13 years 9 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...