Sciweavers

1093 search results - page 108 / 219
» Clustering from Constraint Graphs
Sort
View
ICCD
2006
IEEE
140views Hardware» more  ICCD 2006»
16 years 14 days ago
Clustering-Based Microcode Compression
Abstract— Microcode enables programmability of (micro) architectural structures to enhance functionality and to apply patches to an existing design. As more features get added to...
Edson Borin, Mauricio Breternitz Jr., Youfeng Wu, ...
155
Voted
CIKM
2008
Springer
15 years 5 months ago
Fast mining of complex time-stamped events
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...
Hanghang Tong, Yasushi Sakurai, Tina Eliassi-Rad, ...
171
Voted
SDM
2012
SIAM
252views Data Mining» more  SDM 2012»
13 years 6 months ago
Learning from Heterogeneous Sources via Gradient Boosting Consensus
Multiple data sources containing different types of features may be available for a given task. For instance, users’ profiles can be used to build recommendation systems. In a...
Xiaoxiao Shi, Jean-François Paiement, David...
160
Voted
FSTTCS
1993
Springer
15 years 7 months ago
Compact Location Problems
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
Venkatesh Radhakrishnan, Sven Oliver Krumke, Madha...
ICIP
2008
IEEE
16 years 5 months ago
Variational Bayesian image processing on stochastic factor graphs
In this paper, we present a patch-based variational Bayesian framework of image processing using the language of factor graphs (FGs). The variable and factor nodes of FGs represen...
Xin Li