Sciweavers

194 search results - page 36 / 39
» The Polytope of Degree Partitions
Sort
View
IEEEPACT
2002
IEEE
14 years 2 months ago
Optimizing Loop Performance for Clustered VLIW Architectures
Modern embedded systems often require high degrees of instruction-level parallelism (ILP) within strict constraints on power consumption and chip cost. Unfortunately, a high-perfo...
Yi Qian, Steve Carr, Philip H. Sweany
KCAP
2009
ACM
14 years 2 months ago
An entropy inspired measure for evaluating ontology modularization
Ontology modularization has received growing interest from the research community lately, since it supports tasks such as ontology design/reuse and knowledge selection and integra...
Paul Doran, Valentina A. M. Tamma, Terry R. Payne,...
ISCA
1999
IEEE
110views Hardware» more  ISCA 1999»
14 years 2 months ago
Decoupling Local Variable Accesses in a Wide-Issue Superscalar Processor
Providing adequate data bandwidth is extremely important for a wide-issue superscalar processor to achieve its full performance potential. Adding a large number of ports to a data...
Sangyeun Cho, Pen-Chung Yew, Gyungho Lee
ESA
2008
Springer
142views Algorithms» more  ESA 2008»
13 years 11 months ago
Edge Coloring and Decompositions of Weighted Graphs
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...
Uriel Feige, Mohit Singh
AI
2010
Springer
13 years 10 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