Sciweavers

8825 search results - page 82 / 1765
» All for one or one for all
Sort
View
GLOBECOM
2009
IEEE
14 years 11 months ago
Efficient Data Collection for Wireless Networks: Delay and Energy Tradeoffs
In this paper, we study efficient data collection for wireless sensor networks. We present efficient distributed algorithms with approximately the minimum delay, or the minimum mes...
Chao Ren, XuFei Mao, Xiang-Yang Li, Ping Xu, Guoju...
PODS
2004
ACM
139views Database» more  PODS 2004»
16 years 1 months ago
On Preservation under Homomorphisms and Unions of Conjunctive Queries
Unions of conjunctive queries, also known as select-project-join-union queries, are the most frequently asked queries in relational database systems. These queries are definable b...
Albert Atserias, Anuj Dawar, Phokion G. Kolaitis
IAT
2007
IEEE
15 years 7 months ago
A Distributed Algorithm for Finding Nucleolus-Stable Payoff Divisions
The agents in multiagent systems can coordinate their actions and handle tasks jointly by forming coalitions. One of the important steps in this process is the fair division of pa...
Hrishikesh J. Goradia, José M. Vidal
PPDP
2007
Springer
15 years 7 months ago
Computing with subspaces
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
Sergio Antoy, Bernd Braßel
COMPGEOM
2006
ACM
15 years 7 months ago
Colored intersection searching via sparse rectangular matrix multiplication
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
Haim Kaplan, Micha Sharir, Elad Verbin