Sciweavers

851 search results - page 46 / 171
» Random constructions and density results
Sort
View
TWC
2011
367views more  TWC 2011»
13 years 3 months ago
Improving the Performance of Wireless Ad Hoc Networks Through MAC Layer Design
—In this paper, the performance of the ALOHA and CSMA MAC protocols are analyzed in spatially distributed wireless networks. The main system objective is correct reception of pac...
Mariam Kaynia, Nihar Jindal, Geir E. Øien
STOC
2006
ACM
116views Algorithms» more  STOC 2006»
14 years 8 months ago
Linear degree extractors and the inapproximability of max clique and chromatic number
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...
David Zuckerman
SIAMCOMP
2011
13 years 3 months ago
Black-Box Constructions of Protocols for Secure Computation
In this paper, we study the question of whether or not it is possible to construct protocols for general secure computation in the setting of malicious adversaries and no honest m...
Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yeh...
TEC
2010
191views more  TEC 2010»
13 years 3 months ago
Particle Swarm Optimization Aided Orthogonal Forward Regression for Unified Data Modeling
We propose a unified data modeling approach that is equally applicable to supervised regression and classification applications, as well as to unsupervised probability density func...
Sheng Chen, Xia Hong, Chris J. Harris
ICML
2009
IEEE
14 years 9 months ago
Graph construction and b-matching for semi-supervised learning
Graph based semi-supervised learning (SSL) methods play an increasingly important role in practical machine learning systems. A crucial step in graph based SSL methods is the conv...
Tony Jebara, Jun Wang, Shih-Fu Chang