Sciweavers

131 search results - page 21 / 27
» Revocation Systems with Very Small Private Keys
Sort
View
EMNLP
2007
13 years 9 months ago
Bootstrapping Feature-Rich Dependency Parsers with Entropic Priors
One may need to build a statistical parser for a new language, using only a very small labeled treebank together with raw text. We argue that bootstrapping a parser is most promis...
David A. Smith, Jason Eisner
WWW
2008
ACM
14 years 8 months ago
Ranking refinement and its application to information retrieval
We consider the problem of ranking refinement, i.e., to improve the accuracy of an existing ranking function with a small set of labeled instances. We are, particularly, intereste...
Rong Jin, Hamed Valizadegan, Hang Li
IAT
2009
IEEE
14 years 2 months ago
An Intelligent Agent That Autonomously Learns How to Translate
—We describe the design of an autonomous agent that can teach itself how to translate from a foreign language, by first assembling its own training set, then using it to improve...
Marco Turchi, Tijl De Bie, Nello Cristianini
EUROPKI
2004
Springer
14 years 26 days ago
Trustworthy Accounting for Wireless LAN Sharing Communities
Abstract. The Peer-to-Peer Wireless Network Confederation (P2PWNC) is designed to be an open self-organizing Wireless LAN (WLAN) roaming association where users from one WLAN can a...
Elias C. Efstathiou, George C. Polyzos
ICISC
2004
96views Cryptology» more  ICISC 2004»
13 years 8 months ago
Efficient Broadcast Encryption Using Multiple Interpolation Methods
We propose a new broadcast encryption scheme based on polynomial interpolations. Our scheme, obtained from the Naor-Pinkas scheme by partitioning the user set and interpolating mul...
Eun Sun Yoo, Nam-Su Jho, Jung Hee Cheon, Myung-Hwa...