Sciweavers

2542 search results - page 381 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
131
Voted
CCGRID
2009
IEEE
15 years 1 months ago
Efficient Grid Task-Bundle Allocation Using Bargaining Based Self-Adaptive Auction
To address coordination and complexity issues, we formulate a grid task allocation problem as a bargaining based self-adaptive auction and propose the BarSAA grid task-bundle alloc...
Han Zhao, Xiaolin Li
140
Voted
DATAMINE
2010
175views more  DATAMINE 2010»
15 years 19 days ago
Extracting influential nodes on a social network for information diffusion
We address the combinatorial optimization problem of finding the most influential nodes on a large-scale social network for two widely-used fundamental stochastic diffusion models...
Masahiro Kimura, Kazumi Saito, Ryohei Nakano, Hiro...
98
Voted
FTML
2008
185views more  FTML 2008»
15 years 18 days ago
Graphical Models, Exponential Families, and Variational Inference
The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building large-scale multivariate stat...
Martin J. Wainwright, Michael I. Jordan
117
Voted
TOG
2008
143views more  TOG 2008»
15 years 13 days ago
Discovering structural regularity in 3D geometry
We introduce a computational framework for discovering regular or repeated geometric structures in 3D shapes. We describe and classify possible regular structures and present an e...
Mark Pauly, Niloy J. Mitra, Johannes Wallner, Helm...
CCE
2005
15 years 13 days ago
Selecting maximally informative genes
Microarray experiments are emerging as one of the main driving forces in modern biology. By allowing the simultaneous monitoring of the expression of the entire genome for a given...
Ioannis P. Androulakis