Sciweavers

1272 search results - page 146 / 255
» The Set Cover with Pairs Problem
Sort
View
ICRA
2006
IEEE
95views Robotics» more  ICRA 2006»
14 years 4 months ago
Discrete Approximations to Continuous Curves
Abstract— We consider the problem of approximating a continuous curve by a piecewise linear one whose segments are assumed to be connected by universal joints. Rather than taking...
Sean B. Andersson
CCCG
2006
14 years 1 days ago
On Bipartite Matching under the RMS Distance
Given two sets A and B of n points each in R2 , we study the problem of computing a matching between A and B that minimizes the root mean square (rms) distance of matched pairs. W...
Jeff M. Phillips, Pankaj K. Agarwal
CDC
2010
IEEE
182views Control Systems» more  CDC 2010»
13 years 5 months ago
An approximate dual subgradient algorithm for multi-agent non-convex optimization
We consider a multi-agent optimization problem where agents aim to cooperatively minimize a sum of local objective functions subject to a global inequality constraint and a global ...
Minghui Zhu, Sonia Martínez
SIGMOD
2010
ACM
174views Database» more  SIGMOD 2010»
14 years 3 months ago
Sampling dirty data for matching attributes
We investigate the problem of creating and analyzing samples of relational databases to find relationships between string-valued attributes. Our focus is on identifying attribute...
Henning Köhler, Xiaofang Zhou, Shazia Wasim S...
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
14 years 3 months ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu