Sciweavers

818 search results - page 10 / 164
» Network bargaining: algorithms and structural results
Sort
View
ICDE
2010
IEEE
173views Database» more  ICDE 2010»
14 years 2 months ago
Progressive clustering of networks using Structure-Connected Order of Traversal
— Network clustering enables us to view a complex network at the macro level, by grouping its nodes into units whose characteristics and interrelationships are easier to analyze ...
Dustin Bortner, Jiawei Han
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
13 years 9 months ago
Learning Markov Network Structure using Few Independence Tests
In this paper we present the Dynamic Grow-Shrink Inference-based Markov network learning algorithm (abbreviated DGSIMN), which improves on GSIMN, the state-ofthe-art algorithm for...
Parichey Gandhi, Facundo Bromberg, Dimitris Margar...
JMLR
2010
115views more  JMLR 2010»
13 years 2 months ago
Bayesian structure discovery in Bayesian networks with less space
Current exact algorithms for score-based structure discovery in Bayesian networks on n nodes run in time and space within a polynomial factor of 2n . For practical use, the space ...
Pekka Parviainen, Mikko Koivisto
METMBS
2004
151views Mathematics» more  METMBS 2004»
13 years 9 months ago
Machine Learning Techniques for the Evaluation of External Skeletal Fixation Structures
In this thesis we compare several machine learning techniques for evaluating external skeletal fixation proposals. We experimented in the context of dog bone fractures but the pot...
Ning Suo, Khaled Rasheed, Walter D. Potter, Dennis...
ICPP
2008
IEEE
14 years 2 months ago
Mapping Algorithms for Multiprocessor Tasks on Multi-Core Clusters
In this paper, we explore the use of hierarchically structured multiprocessor tasks (M-tasks) for programming multi-core cluster systems. These systems often have hierarchically s...
Jörg Dümmler, Thomas Rauber, Gudula R&uu...