761 search results - page 111 / 153 » Efficient Approximation Algorithms for the Subset-Sums Equal... |
ICMLA
2008
13 years 9 months ago
2008
Time-series segmentation in the fully unsupervised scenario in which the number of segment-types is a priori unknown is a fundamental problem in many applications. We propose a Ba...
CGF
2008
13 years 7 months ago
2008
Rendering animations of scenes with deformable objects, camera motion, and complex illumination, including indirect lighting and arbitrary shading, is a long-standing challenge. P...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
IEEEMSP
2002
IEEE
14 years 19 days ago
2002
IEEE
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
ICRA
1999
IEEE
14 years 13 hour ago
1999
IEEE
Mobile robot localization is the problem of determining a robot's pose from sensor data. This article presents a family of probabilisticlocalization algorithms known as Monte...