Sciweavers

350 search results - page 67 / 70
» Approximation Algorithms for Unique Games
Sort
View
ESA
2006
Springer
140views Algorithms» more  ESA 2006»
13 years 11 months ago
Latency Constrained Aggregation in Sensor Networks
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
Luca Becchetti, Peter Korteweg, Alberto Marchetti-...
VLDB
2001
ACM
82views Database» more  VLDB 2001»
13 years 12 months ago
Supporting Incremental Join Queries on Ranked Inputs
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
Apostol Natsev, Yuan-Chi Chang, John R. Smith, Chu...
EMSOFT
2005
Springer
14 years 1 months ago
Deeply embedded XML communication: towards an interoperable and seamless world
Current consumer electronics devices do not interoperate and are hard to use. Devices use proprietary, device-specific and inflexible protocols. Resources across device classes, s...
Johannes Helander
ASM
2004
ASM
14 years 27 days ago
Observations on the Decidability of Transitions
Consider a multiple-agent transition system such that, for some basic types T1, . . . , Tn, the state of any agent can be represented as an element of the Cartesian product T1 ×·...
Yuri Gurevich, Rostislav Yavorskiy
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
14 years 21 days ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun