Sciweavers

1998 search results - page 309 / 400
» Complexity of the Cover Polynomial
Sort
View
AOR
2006
95views more  AOR 2006»
15 years 22 days ago
A New Practically Efficient Interior Point Method for LP
In this paper we briefly review the importance of LP (linear programming), and Dantzig's main contributions to OR (Operations Research), mathematics, and computer science. In...
Katta G. Murty
93
Voted
ICGI
2010
Springer
14 years 11 months ago
Learning PDFA with Asynchronous Transitions
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...
Borja Balle, Jorge Castro, Ricard Gavaldà
COLT
2010
Springer
14 years 10 months ago
Toward Learning Gaussian Mixtures with Arbitrary Separation
In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory commun...
Mikhail Belkin, Kaushik Sinha
117
Voted
MOBIHOC
2010
ACM
14 years 10 months ago
On quality of monitoring for multi-channel wireless infrastructure networks
Passive monitoring utilizing distributed wireless sniffers is an effective technique to monitor activities in wireless infrastructure networks for fault diagnosis, resource manage...
Arun Chhetri, Huy Anh Nguyen, Gabriel Scalosub, Ro...
122
Voted
ASIACRYPT
2011
Springer
14 years 20 days ago
Resettable Cryptography in Constant Rounds - The Case of Zero Knowledge
A fundamental question in cryptography deals with understanding the role that randomness plays in cryptographic protocols and to what extent it is necessary. One particular line o...
Yi Deng, Dengguo Feng, Vipul Goyal, Dongdai Lin, A...