Sciweavers

4137 search results - page 478 / 828
» On the number of matchings of a tree
Sort
View
CVPR
2011
IEEE
15 years 2 months ago
Structure from motion for scenes with large duplicate structures
Most existing structure from motion (SFM) approaches for unordered images cannot handle multiple instances of the same structure in the scene. When image pairs containing differen...
Richard Roberts, Sudipta Sinha, Richard Szeliski, ...
JCIT
2010
176views more  JCIT 2010»
15 years 1 months ago
Enhanced Block Motion Estimation Based on Threshold-Aware Two-Path Search Method
For stationary or quasi-stationary frames of a video sequence, traditional block matching algorithms (BMA) will easily lead the search to be trapped into a local minimum. In this ...
Wei-Chih Hsu, Tsan-Ying Yu, Jan-Lie Guo
SIAMDM
2010
99views more  SIAMDM 2010»
15 years 1 months ago
On the Stable Paths Problem
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...
Penny E. Haxell, Gordon T. Wilfong
TCOM
2010
65views more  TCOM 2010»
15 years 1 months ago
Max-matching diversity in OFDMA systems
Abstract--This paper considers the problem of optimal subcarrier allocation in OFDMA systems to achieve the minimum outage probability while guaranteeing fairness. The optimal subc...
Bo Bai, Wei Chen, Zhigang Cao, Khaled Ben Letaief
CORR
2010
Springer
175views Education» more  CORR 2010»
15 years 1 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