8437 search results - page 220 / 1688 » Preferences over Sets |
148
Voted
FUIN
2007
15 years 6 months ago
2007
Abstract. In the paper two notions related to local (distributed) computations are identified and discussed. The first one is the notion of reducible graphs. A graph is reducible...
190
click to vote
IS
2007
15 years 6 months ago
2007
Sensors are often employed to monitor continuously changing entities like locations of moving objects and temperature. The sensor readings are reported to a database system, and a...
185
click to vote
TKDE
2008
15 years 6 months ago
2008
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...
171
click to vote
TMC
2008
15 years 6 months ago
2008
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Moreo...
149
click to vote
AIR
2004
15 years 6 months ago
2004
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...