Sciweavers

3708 search results - page 193 / 742
» Approximating Betweenness Centrality
Sort
View
186
Voted
JMLR
2010
157views more  JMLR 2010»
15 years 27 days ago
Why are DBNs sparse?
Real stochastic processes operating in continuous time can be modeled by sets of stochastic differential equations. On the other hand, several popular model families, including hi...
Shaunak Chatterjee, Stuart Russell
JMLR
2010
141views more  JMLR 2010»
15 years 27 days ago
Hierarchical Gaussian Process Regression
We address an approximation method for Gaussian process (GP) regression, where we approximate covariance by a block matrix such that diagonal blocks are calculated exactly while o...
Sunho Park, Seungjin Choi
BIOWIRE
2007
Springer
16 years 9 days ago
Coalition Games and Resource Allocation in Ad-Hoc Networks
In this paper we explore some of the connections between cooperative game theory and the utility maximization framework for routing and flow control in networks. Central to both a...
Richard J. Gibbens, Peter B. Key
KDD
1998
ACM
84views Data Mining» more  KDD 1998»
15 years 10 months ago
Similarity of Attributes by External Probes
In data mining, similarity or distance between attributes is one of the central notions. Such a notion can be used to build attribute hierarchies etc. Similarity metrics can be us...
Gautam Das, Heikki Mannila, Pirjo Ronkainen
CVPR
2008
IEEE
16 years 8 months ago
Who killed the directed model?
Prior distributions are useful for robust low-level vision, and undirected models (e.g. Markov Random Fields) have become a central tool for this purpose. Though sometimes these p...
Justin Domke, Alap Karapurkar, Yiannis Aloimonos