Sciweavers

361 search results - page 40 / 73
» Approximate counting by dynamic programming
Sort
View
CVPR
2006
IEEE
14 years 9 months ago
Improving Border Localization of Multi-Baseline Stereo Using Border-Cut
This paper presents a novel algorithm that improves the localization of disparity discontinuities of disparity maps obtained by multi-baseline stereo. Rather than associating a di...
Marc-Antoine Drouin, Martin Trudeau, Sébast...
PDPTA
2007
13 years 9 months ago
Brokering Algorithms for Composing Low Cost Distributed Storage Resources
Abstract In this paper we investigate the composition of cheap network storage resources to meet specific availability and capacity requirements. We show that the problem of find...
Jimmy Secretan, Malachi Lawson, Ladislau Böl&...
IPL
2006
97views more  IPL 2006»
13 years 7 months ago
A fixed-parameter tractability result for multicommodity demand flow in trees
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
Jiong Guo, Rolf Niedermeier
TSMC
2008
177views more  TSMC 2008»
13 years 6 months ago
Adaptive Critic Learning Techniques for Engine Torque and Air-Fuel Ratio Control
A new approach for engine calibration and control is proposed. In this paper, we present our research results on the implementation of adaptive critic designs for self-learning con...
Derong Liu, Hossein Javaherian, Olesia Kovalenko, ...
ICRA
2002
IEEE
147views Robotics» more  ICRA 2002»
14 years 15 days ago
Design of Asymptotically Stable Walking for a 5-Link Planar Biped Walker via Optimization
— Closed-loop, asymptotically stable walking motions are designed for a 5-link, planar bipedal robot model with one degree of underactuation. Parameter optimization is applied to...
E. R. Westervelt, J. W. Grizzle