1629 search results - page 195 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
CORR
2006
Springer
14 years 10 months ago
2006
Springer
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
100
click to vote
PLDI
2004
ACM
15 years 3 months ago
2004
ACM
This paper presents the first scalable context-sensitive, inclusionbased pointer alias analysis for Java programs. Our approach to context sensitivity is to create a clone of a m...
104
click to vote
DAC
2010
ACM
2010
ACM
A probabilistic and energy-efficient scheduling approach for online application in real-time systems
15 years 1 months ago
This work considers the problem of minimizing the power consumption for real-time scheduling on processors with discrete operating modes. We provide a model for determining the ex...
ECCV
2002
Springer
15 years 12 months ago
2002
Springer
In this paper we propose an extension to the standard Markov Random Field (MRF) model in order to handle layers. Our extension, which we call a Factorial MRF (FMRF), is analogous t...
CVPR
2007
IEEE
16 years 3 days ago
2007
IEEE
A new efficient MRF optimization algorithm, called FastPD, is proposed, which generalizes -expansion. One of its main advantages is that it offers a substantial speedup over that ...