Sciweavers

1383 search results - page 210 / 277
» On the Complexity of the Interlace Polynomial
Sort
View
101
Voted
ICGI
2010
Springer
15 years 15 days 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 12 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
ASIACRYPT
2011
Springer
14 years 1 months 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...
CVPR
2009
IEEE
16 years 9 months ago
Cooperative Mapping of Multiple PTZ Cameras in Automated Surveillance Systems
Due to the capacity of pan-tilt-zoom (PTZ) cameras to simultaneously cover a panoramic area and maintain high resolution imagery, researches in automated surveillance systems wi...
Andreas Koschan, Anis Drira, Chung-Chen Chen, Mong...
ICCV
2009
IEEE
16 years 7 months ago
Moving in Stereo: Efficient Structure and Motion Using Lines
We present a fast and robust system for estimating structure and motion using a stereo pair, with straight lines as features. Our first set of contributions are efficient algorit...
Manmohan Chandraker, Jongwoo Lim, David Kriegman