Sciweavers

1184 search results - page 17 / 237
» Nearness relations and topology
Sort
View
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
14 years 3 months 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
INFOCOM
2010
IEEE
13 years 7 months ago
Reliable Wireless Broadcasting with Near-Zero Feedback
We examine the problem of minimizing feedbacks in reliable wireless broadcasting, by pairing rateless coding with extreme value theory. Our key observation is that, in a broadcast ...
Weiyao Xiao, Sachin Agarwal, David Starobinski, Ar...
ISPA
2005
Springer
14 years 3 months ago
Near Optimal Routing in a Small-World Network with Augmented Local Awareness
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
Jianyang Zeng, Wen-Jing Hsu, Jiangdian Wang
STOC
2012
ACM
209views Algorithms» more  STOC 2012»
12 years 8 days ago
Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
Anindya De, Ilias Diakonikolas, Vitaly Feldman, Ro...
ICCS
2009
Springer
14 years 4 months ago
Spatial Relations Analysis by Using Fuzzy Operators
Spatial relations play important role in computer vision, scene analysis, geographic information systems (GIS) and content based image retrieval. Analyzing spatial relations by Fo...
Nadeem Salamat, El-hadi Zahzah