Sciweavers

103 search results - page 12 / 21
» Minimal Separating Sequences for All Pairs of States
Sort
View
CORR
2010
Springer
175views Education» more  CORR 2010»
13 years 4 months ago
On the Combinatorial Multi-Armed Bandit Problem with Markovian Rewards
We consider a combinatorial generalization of the classical multi-armed bandit problem that is defined as follows. There is a given bipartite graph of M users and N M resources. F...
Yi Gai, Bhaskar Krishnamachari, Mingyan Liu
TWC
2008
131views more  TWC 2008»
13 years 10 months ago
On channel estimation and optimal training design for amplify and forward relay networks
In this paper, we provide a complete study on the training based channel estimation issues for relay networks that employ the amplify-and-forward (AF) transmission scheme. We first...
Feifei Gao, Tao Cui, Arumugam Nallanathan
BMCBI
2007
134views more  BMCBI 2007»
13 years 10 months ago
Efficient pairwise RNA structure prediction using probabilistic alignment constraints in Dynalign
Background: Joint alignment and secondary structure prediction of two RNA sequences can significantly improve the accuracy of the structural predictions. Methods addressing this p...
Arif Ozgun Harmanci, Gaurav Sharma, David H. Mathe...
APPROX
2009
Springer
195views Algorithms» more  APPROX 2009»
14 years 5 months ago
Approximating Node-Connectivity Augmentation Problems
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
Zeev Nutov
ICRA
2007
IEEE
189views Robotics» more  ICRA 2007»
14 years 4 months ago
Stereo-based Markerless Human Motion Capture for Humanoid Robot Systems
Abstract— In this paper, we present an image-based markerless human motion capture system, intended for humanoid robot systems. The restrictions set by this ambitious goal are nu...
Pedram Azad, Ales Ude, Tamim Asfour, Rüdiger ...