15416 search results - page 2884 / 3084 » Embeddings of Computable Structures |
184
click to vote
PODS
2005
ACM
16 years 6 months ago
2005
ACM
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
148
click to vote
MOBIHOC
2008
ACM
16 years 6 months ago
2008
ACM
In this paper, we identify a new problem in wireless sensor networks, distance sensitive service discovery, where nearby or closest service selection guarantee is expected. We pro...
158
click to vote
PPOPP
2010
ACM
16 years 3 months ago
2010
ACM
Drawing inspiration from several previous projects, we present an ownership-record-free software transactional memory (STM) system that combines extremely low overhead with unusua...
193
click to vote
SPAA
2009
ACM
16 years 3 months ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
200
click to vote
ICDCS
2009
IEEE
16 years 3 months ago
2009
IEEE
Users and administrators of large distributed systems are frequently in need of monitoring and management of its various components, data items and resources. Though there exist s...