Sciweavers

1159 search results - page 179 / 232
» Binary Decision Graphs
Sort
View
ICML
2007
IEEE
14 years 11 months ago
Efficient inference with cardinality-based clique potentials
Many collective labeling tasks require inference on graphical models where the clique potentials depend only on the number of nodes that get a particular label. We design efficien...
Rahul Gupta, Ajit A. Diwan, Sunita Sarawagi
SDM
2009
SIAM
160views Data Mining» more  SDM 2009»
14 years 7 months ago
Discovering Substantial Distinctions among Incremental Bi-Clusters.
A fundamental task of data analysis is comprehending what distinguishes clusters found within the data. We present the problem of mining distinguishing sets which seeks to find s...
Faris Alqadah, Raj Bhatnagar
ICCAD
2005
IEEE
98views Hardware» more  ICCAD 2005»
14 years 7 months ago
Clustering for processing rate optimization
Clustering (or partitioning) is a crucial step between logic synthesis and physical design in the layout of a large scale design. A design verified at the logic synthesis level m...
Chuan Lin, Jia Wang, Hai Zhou
STACS
2010
Springer
14 years 5 months ago
The Complexity of Approximating Bounded-Degree Boolean #CSP
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsen...
MICRO
2007
IEEE
141views Hardware» more  MICRO 2007»
14 years 4 months ago
Composable Lightweight Processors
Modern chip multiprocessors (CMPs) are designed to exploit both instruction-level parallelism (ILP) within processors and thread-level parallelism (TLP) within and across processo...
Changkyu Kim, Simha Sethumadhavan, M. S. Govindan,...