Sciweavers

112 search results - page 18 / 23
» Improved algorithms for hypergraph bipartitioning
Sort
View
AI
2010
Springer
13 years 6 months ago
Understanding the scalability of Bayesian network inference using clique tree growth curves
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
Ole J. Mengshoel
SDM
2008
SIAM
123views Data Mining» more  SDM 2008»
13 years 8 months ago
Constrained Co-clustering of Gene Expression Data
In many applications, the expert interpretation of coclustering is easier than for mono-dimensional clustering. Co-clustering aims at computing a bi-partition that is a collection...
Ruggero G. Pensa, Jean-François Boulicaut
AI
2006
Springer
13 years 6 months ago
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
Ole J. Mengshoel, David C. Wilkins, Dan Roth
DAC
2006
ACM
14 years 7 months ago
Architecture-aware FPGA placement using metric embedding
Since performance on FPGAs is dominated by the routing architecture rather than wirelength, we propose a new architecture-aware approach to initial FPGA placement that models the ...
Padmini Gopalakrishnan, Xin Li, Lawrence T. Pilegg...
COLING
2010
13 years 1 months ago
Extracting and Ranking Product Features in Opinion Documents
An important task of opinion mining is to extract people's opinions on features of an entity. For example, the sentence, "I love the GPS function of Motorola Droid"...
Lei Zhang, Bing Liu, Suk Hwan Lim, Eamonn O'Brien-...