630 search results - page 17 / 126 » Optimized union of non-disjoint distributed data sets |
120
click to vote
IROS
2007
IEEE
16 years 8 days ago
2007
IEEE
— This paper considers the problem of allocating tasks among robots that operate on a 3D truss. Each robot is commanded to navigate to a different location for work. When the inf...
151
click to vote
COMPGEOM
2000
ACM
15 years 10 months ago
2000
ACM
We describe a kinetic data structure (KDS) that maintains the connected components of the union of a set of unit-radius disks moving in the plane. We assume that the motion of eac...
161
click to vote
ICDE
2010
IEEE
16 years 3 months ago
2010
IEEE
— One of the central problems for data quality is inconsistency detection. Given a database D and a set Σ of dependencies as data quality rules, we want to identify tuples in D ...
183
click to vote
TKDE
2002
15 years 5 months ago
2002
In a large-scale information system such as a digital library or the web, a set of distributed caches can improve their effectiveness by coordinating their data placement decisions...
160
click to vote
ICDCS
2000
IEEE
15 years 10 months ago
2000
IEEE
Creating replicas of frequently accessed objects across a read-intensive network can result in large bandwidth savings which, in turn, can lead to reduction in user response time....