Sciweavers

7978 search results - page 290 / 1596
» Combining shared-coin algorithms
Sort
View
ICASSP
2011
IEEE
14 years 8 months ago
Variational methods for spectral unmixing of hyperspectral images
This paper studies a variational Bayesian unmixing algorithm for hyperspectral images based on the standard linear mixing model. Each pixel of the image is modeled as a linear com...
Olivier Eches, Nicolas Dobigeon, Jean-Yves Tourner...
INFOCOM
2011
IEEE
14 years 8 months ago
Optimizing network-coded cooperative communications via joint session grouping and relay node selection
Abstract—Network-coded cooperative communications (NCCC) is a new paradigm in wireless networks that employs network coding (NC) to improve the performance of CC. The core mechan...
Sushant Sharma, Yi Shi, Y. Thomas Hou, Hanif D. Sh...
GECCO
2011
Springer
374views Optimization» more  GECCO 2011»
14 years 8 months ago
A hybrid heuristic approach for solving the generalized traveling salesman problem
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
Petrica C. Pop, Serban Iordache
ATAL
2011
Springer
14 years 4 months ago
Metric learning for reinforcement learning agents
A key component of any reinforcement learning algorithm is the underlying representation used by the agent. While reinforcement learning (RL) agents have typically relied on hand-...
Matthew E. Taylor, Brian Kulis, Fei Sha
COCO
2011
Springer
221views Algorithms» more  COCO 2011»
14 years 4 months ago
Non-uniform ACC Circuit Lower Bounds
The class ACC consists of circuit families with constant depth over unbounded fan-in AND, OR, NOT, and MODm gates, where m > 1 is an arbitrary constant. We prove: • NTIME[2n ...
Ryan Williams