952 search results - page 126 / 191 » Computational complexity of stochastic programming problems |
140
click to vote
INFOCOM
2012
IEEE
13 years 5 months ago
2012
IEEE
—In this paper we study the resource allocation in OFDM-based cognitive radio (CR) networks, under the consideration of many practical limitations such as imperfect spectrum sens...
132
click to vote
PODS
2007
ACM
16 years 3 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
102
click to vote
ARTS
1997
Springer
15 years 6 months ago
1997
Springer
There have been significant advances on formal methods to verify complex systems recently. Nevertheless, these methods have not yet been accepted as a realistic alternative to the ...
142
click to vote
CVPR
2006
IEEE
16 years 5 months ago
2006
IEEE
Resolving local ambiguities is an important issue for shape from shading (SFS). Pixel ambiguities of SFS can be eliminated by propagation approaches. However, patch ambiguities st...
101
click to vote
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location proble...