Sciweavers

5214 search results - page 674 / 1043
» The Online Specialization Problem
Sort
View
TSMC
1998
82views more  TSMC 1998»
15 years 6 months ago
To push or not to push: on the rearrangement of movable objects by a mobile robot
—We formulate and address the problem of planning a pushing manipulation by a mobile robot which tries to rearrange several movable objects in its work space. We present an algor...
Ohad Ben-Shahar, Ehud Rivlin
PAMI
2007
176views more  PAMI 2007»
15 years 6 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
INFOCOM
2010
IEEE
15 years 5 months ago
Understanding Sub-stream Scheduling in P2P Hybrid Live Streaming Systems
—The P2P pull-push hybrid architecture has achieved great success in delivering live video traffic over the Internet. However, a formal study on the sub-stream scheduling proble...
Zhenjiang Li, Danny H. K. Tsang, Wang-Chien Lee
PAMI
2008
174views more  PAMI 2008»
15 years 5 months ago
Geometric Observers for Dynamically Evolving Curves
Abstract-- This paper proposes a deterministic observer design for visual tracking based on non-parametric implicit (level-set) curve descriptions. The observer is continuous-discr...
Marc Niethammer, Patricio A. Vela, Allen Tannenbau...
JMIV
2010
98views more  JMIV 2010»
15 years 5 months ago
Expectations of Random Sets and Their Boundaries Using Oriented Distance Functions
Shape estimation and object reconstruction are common problems in image analysis. Mathematically, viewing objects in the image plane as random sets reduces the problem of shape es...
Hanna K. Jankowski, Larissa I. Stanberry