Sciweavers

714 search results - page 62 / 143
» An efficient algorithm for positive realizations
Sort
View
CVPR
2005
IEEE
16 years 1 months ago
Radon-Based Structure from Motion without Correspondences
We present a novel approach for the estimation of 3Dmotion directly from two images using the Radon transform. We assume a similarity function defined on the crossproduct of two i...
Ameesh Makadia, Christopher Geyer, Shankar Sastry,...
CVPR
2008
IEEE
16 years 1 months ago
Enforcing non-positive weights for stable support vector tracking
In this paper we demonstrate that the support vector tracking (SVT) framework first proposed by Avidan is equivalent to the canonical Lucas-Kanade (LK) algorithm with a weighted E...
Simon Lucey
JSAC
2008
111views more  JSAC 2008»
14 years 11 months ago
The end-to-end rate control in multiple-hop wireless networks: Cross-layer formulation and optimal allocation
In this paper, we study the theoretical problem of the end-to-end rate assignment for multi-hop wireless networks. Specifically, we consider the problem of joint congestion control...
Chengnian Long, Bo Li, Qian Zhang, Bin Zhao, Bo Ya...
MOBIHOC
2006
ACM
15 years 11 months ago
Minimizing recovery state In geographic ad-hoc routing
Geographic ad hoc networks use position information for routing. They often utilize stateless greedy forwarding and require the use of recovery algorithms when the greedy approach...
Noa Arad, Yuval Shavitt
STOC
2003
ACM
154views Algorithms» more  STOC 2003»
16 years 4 days ago
Boosting in the presence of noise
Boosting algorithms are procedures that "boost" low-accuracy weak learning algorithms to achieve arbitrarily high accuracy. Over the past decade boosting has been widely...
Adam Kalai, Rocco A. Servedio