Sciweavers

49 search results - page 9 / 10
» Recent Progress and Open Problems in Algorithmic Convex Geom...
Sort
View
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 7 months ago
Polynomial Learning of Distribution Families
Abstract--The question of polynomial learnability of probability distributions, particularly Gaussian mixture distributions, has recently received significant attention in theoreti...
Mikhail Belkin, Kaushik Sinha
SASN
2003
ACM
14 years 21 days ago
A cooperative intrusion detection system for ad hoc networks
Mobile ad hoc networking (MANET) has become an exciting and important technology in recent years because of the rapid proliferation of wireless devices. MANETs are highly vulnerab...
Yi-an Huang, Wenke Lee
APPROX
2011
Springer
242views Algorithms» more  APPROX 2011»
12 years 7 months ago
New Tools for Graph Coloring
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
Sanjeev Arora, Rong Ge
JMLR
2011
148views more  JMLR 2011»
13 years 2 months ago
Multitask Sparsity via Maximum Entropy Discrimination
A multitask learning framework is developed for discriminative classification and regression where multiple large-margin linear classifiers are estimated for different predictio...
Tony Jebara
FOCS
2006
IEEE
14 years 1 months ago
Computing Nash Equilibria: Approximation and Smoothed Complexity
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
Xi Chen, Xiaotie Deng, Shang-Hua Teng