Sciweavers

1248 search results - page 213 / 250
» On the Number of Birch Partitions
Sort
View
STOC
2002
ACM
119views Algorithms» more  STOC 2002»
16 years 6 months ago
Space-efficient approximate Voronoi diagrams
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
Sunil Arya, Theocharis Malamatos, David M. Mount
SIGECOM
2009
ACM
134views ECommerce» more  SIGECOM 2009»
16 years 19 days ago
On representing coalitional games with externalities
We consider the issue of representing coalitional games in multiagent systems with externalities (i.e., in systems where the performance of one coalition may be affected by other ...
Tomasz P. Michalak, Talal Rahwan, Jacek Sroka, And...
FCCM
2008
IEEE
212views VLSI» more  FCCM 2008»
16 years 17 days ago
Map-reduce as a Programming Model for Custom Computing Machines
The map-reduce model requires users to express their problem in terms of a map function that processes single records in a stream, and a reduce function that merges all mapped out...
Jackson H. C. Yeung, C. C. Tsang, Kuen Hung Tsoi, ...
ICC
2007
IEEE
214views Communications» more  ICC 2007»
16 years 13 days ago
Distributed ONS and its Impact on Privacy
— The EPC Network is an industry proposal to build a global information architecture for objects carrying RFID tags with Electronic Product Codes (EPC). A so-called Object Naming...
Benjamin Fabian, Oliver Günther
STACS
2007
Springer
16 years 7 days ago
Testing Convexity Properties of Tree Colorings
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
Eldar Fischer, Orly Yahalom