Sciweavers

121 search results - page 16 / 25
» Algorithms for Large Scale Markov Blanket Discovery
Sort
View
JMLR
2010
115views more  JMLR 2010»
13 years 5 months ago
Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
Pradeep Ravikumar, Alekh Agarwal, Martin J. Wainwr...
IPPS
2007
IEEE
14 years 1 months ago
Distributed Aggregation Algorithms with Load-Balancing for Scalable Grid Resource Monitoring
1 Scalable resource monitoring and discovery are essential to the planet-scale infrastructures such as Grids and PlanetLab. This paper proposes a scalable Grid monitoring architect...
Min Cai, Kai Hwang
ICML
2004
IEEE
14 years 8 months ago
Training conditional random fields via gradient tree boosting
Conditional Random Fields (CRFs; Lafferty, McCallum, & Pereira, 2001) provide a flexible and powerful model for learning to assign labels to elements of sequences in such appl...
Thomas G. Dietterich, Adam Ashenfelter, Yaroslav B...
WIAMIS
2009
IEEE
14 years 2 months ago
Adaptive gesture recognition in Human Computer Interaction
An adaptive, invariant to user performance fluctuation or noisy input signal, gesture recognition scheme is presented based on Self Organizing Maps, Markov Models and Levenshtein...
George Caridakis, Kostas Karpouzis, Athanasios I. ...
DFT
2007
IEEE
95views VLSI» more  DFT 2007»
14 years 1 months ago
Fault Tolerant Source Routing for Network-on-Chip
This paper presents a new routing protocol of network-on-chip(Noc) called ‘Source Routing for Noc’(SRN) for fault tolerant communication of Systems-on-chip(Soc). The proposed ...
Young Bok Kim, Yong-Bin Kim