1629 search results - page 101 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
CIKM
2008
Springer
14 years 12 months ago
2008
Springer
As online social networking emerges, there has been increased interest to utilize the underlying social structure as well as the available social information to improve search. In...
CASES
2006
ACM
15 years 3 months ago
2006
ACM
Dynamic voltage scaling and sleep state control have been shown to be extremely effective in reducing energy consumption in CMOS circuits. Though plenty of research papers have st...
100
click to vote
DAC
2010
ACM
14 years 10 months ago
2010
ACM
Leveraging the power of nowadays graphics processing units for robust power grid simulation remains a challenging task. Existing preconditioned iterative methods that require inco...
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
141
click to vote
PAMI
2010
14 years 8 months ago
2010
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...