1605 search results - page 190 / 321 » On Partitional Labelings of Graphs |
100
Voted
ICESS
2007
Springer
15 years 7 months ago
2007
Springer
In an embedded system including a base processor integrated with a tightly coupled accelerator, extracting frequently executed portions of the code (hot portion) and executing thei...
105
Voted
CORR
2008
Springer
15 years 26 days ago
2008
Springer
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
91
Voted
CASES
2010
ACM
14 years 10 months ago
2010
ACM
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
140
Voted
JMLR
2010
14 years 7 months ago
2010
We introduce novel results for approximate inference on planar graphical models using the loop calculus framework. The loop calculus (Chertkov and Chernyak, 2006b) allows to expre...
WWW
2009
ACM
16 years 1 months ago
2009
ACM
In this paper we consider the problem of re-ranking search results by incorporating user feedback. We present a graph theoretic measure for discriminating irrelevant results from ...