Sciweavers

952 search results - page 64 / 191
» Computational complexity of stochastic programming problems
Sort
View
115
Voted
ICN
2007
Springer
15 years 6 months ago
Heuristic Approach of Optimal Code Allocation in High Speed Downlink Packet Access Networks
— In this paper, we use the Markov Decision Process (MDP) technique to find the optimal code allocation policy in High-Speed Downlink Packet Access (HSDPA) networks. A discrete ...
Hussein Al-Zubaidy, Jerome Talim, Ioannis Lambadar...
104
Voted
STOC
2006
ACM
149views Algorithms» more  STOC 2006»
16 years 26 days ago
Bounded-error quantum state identification and exponential separations in communication complexity
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald d...
96
Voted
CVPR
2007
IEEE
16 years 2 months ago
A Linear Programming Approach for Multiple Object Tracking
We propose a linear programming relaxation scheme for the class of multiple object tracking problems where the inter-object interaction metric is convex and the intraobject term q...
Hao Jiang, Sidney Fels, James J. Little
104
Voted
BMCBI
2008
211views more  BMCBI 2008»
15 years 20 days ago
CPSP-tools - Exact and complete algorithms for high-throughput 3D lattice protein studies
Background: The principles of protein folding and evolution pose problems of very high inherent complexity. Often these problems are tackled using simplified protein models, e.g. ...
Martin Mann, Sebastian Will, Rolf Backofen
121
Voted
TSP
2010
14 years 7 months ago
Sequential and cooperative sensing for multi-channel cognitive radios
Effective spectrum sensing is a critical prerequisite for multi-channel cognitive radio (CR) networks, where multiple spectrum bands are sensed to identify transmission opportuniti...
Seung-Jun Kim, Georgios B. Giannakis