Sciweavers

279 search results - page 50 / 56
» A Name Abstraction Functor for Named Sets
Sort
View
FOCS
2009
IEEE
16 years 25 days ago
2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...
Yael Tauman Kalai, Xin Li, Anup Rao
IPPS
2009
IEEE
16 years 21 days ago
Network awareness of P2P live streaming applications
Abstract—Early P2P-TV systems have already attracted millions of users, and many new commercial solutions are entering this market. Little information is however available about ...
Delia Ciullo, M.-A. Garcia da Rocha Neta, Á...
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
16 years 20 days ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
XSYM
2009
Springer
136views Database» more  XSYM 2009»
16 years 20 days ago
Optimizing XML Compression
Abstract. The eXtensible Markup Language (XML) provides a powerful and flexible means of encoding and exchanging data. As it turns out, its main advantage as an encoding format (n...
Gregory Leighton, Denilson Barbosa
ERSHOV
2009
Springer
16 years 19 days ago
Towards a Scalable, Pragmatic Knowledge Representation Language for the Web
Abstract. A basic cornerstone of the Semantic Web are formal languages for describing resources in a clear and unambiguous way. Logical underpinnings facilitate automated reasoning...
Florian Fischer, Gulay Ünel, Barry Bishop, Di...