1272 search results - page 146 / 255 » The Set Cover with Pairs Problem |
123
click to vote
ICRA
2006
IEEE
15 years 9 months ago
2006
IEEE
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...
110
click to vote
CCCG
2006
15 years 4 months ago
2006
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...
139
Voted
CDC
2010
IEEE
14 years 10 months ago
2010
IEEE
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 ...
138
click to vote
SIGMOD
2010
ACM
15 years 8 months ago
2010
ACM
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...
146
Voted
SIGMOD
2010
ACM
15 years 8 months ago
2010
ACM
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...