Sciweavers

1722 search results - page 95 / 345
» Variables in Concept Graphs
Sort
View
EMSOFT
2005
Springer
15 years 3 months ago
Communication strategies for shared-bus embedded multiprocessors
Abstract— This paper explores the problem of efficiently ordering interprocessor communication operations in both statically and dynamically-scheduled multiprocessors for iterat...
Neal K. Bambha, Shuvra S. Bhattacharyya
ICCD
1996
IEEE
170views Hardware» more  ICCD 1996»
15 years 2 months ago
Boolean Function Representation Based on Disjoint-Support Decompositions
The Multi-Level Decomposition Diagrams (MLDDs) of this paper are a canonical representation of Boolean functions expliciting disjoint-support decompositions. MLDDs allow the reduc...
Valeria Bertacco, Maurizio Damiani
AAAI
2006
14 years 11 months ago
An Efficient Way of Breaking Value Symmetries
Several methods for breaking value symmetries have been proposed recently in the constraint programming community. They can be used in conjunction with variable symmetry breaking ...
Jean-François Puget
JAIR
2007
112views more  JAIR 2007»
14 years 9 months ago
Cutset Sampling for Bayesian Networks
The paper presents a new sampling methodology for Bayesian networks that samples only a subset of variables and applies exact inference to the rest. Cutset sampling is a network s...
Bozhena Bidyuk, Rina Dechter
ICDE
2009
IEEE
145views Database» more  ICDE 2009»
15 years 4 months ago
Context-Aware Object Connection Discovery in Large Graphs
— Given a large graph and a set of objects, the task of object connection discovery is to find a subgraph that retains the best connection between the objects. Object connection...
James Cheng, Yiping Ke, Wilfred Ng, Jeffrey Xu Yu