Sciweavers

731 search results - page 112 / 147
» Reductions to Graph Isomorphism
Sort
View
ADHOCNOW
2004
Springer
14 years 2 months ago
Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
Errol L. Lloyd, Rui Liu, S. S. Ravi
COCO
2010
Springer
129views Algorithms» more  COCO 2010»
14 years 23 days ago
On the Relative Strength of Pebbling and Resolution
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
Jakob Nordström
CONEXT
2008
ACM
13 years 10 months ago
Online estimation of RF interference
Increased AP density in enterprise WLANs leads to increasing RF interference and decreasing performance. An important step towards mitigating this problem is to construct precise ...
Nabeel Ahmed, Usman Ismail, Srinivasan Keshav, Kon...
CVPR
2010
IEEE
14 years 5 months ago
Vessel Scale Selection using MRF Optimization
Many feature detection algorithms rely on the choice of scale. In this paper, we complement standard scaleselection algorithms with spatial regularization. To this end, we formula...
Hengameh Mirzaalian, Ghassan Hamarneh
CP
2007
Springer
14 years 3 months ago
Constraint Symmetry for the Soft CSP
We introduce a definition of constraint symmetry for soft CSPs, based on the definition of constraint symmetry for classical CSPs. We show that the constraint symmetry group of a...
Barbara M. Smith, Stefano Bistarelli, Barry O'Sull...