2629 search results - page 524 / 526 » complex 2009 |
ASIACRYPT
2011
Springer
12 years 5 months ago
2011
Springer
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...
LICS
2012
IEEE
11 years 8 months ago
2012
IEEE
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
WWW
2009
ACM
14 years 6 months ago
2009
ACM
Web forums have become an important data resource for many web applications, but extracting structured data from unstructured web forum pages is still a challenging task due to bo...
STOC
2009
ACM
14 years 6 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
STOC
2009
ACM
14 years 6 months ago
2009
ACM
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...