Sciweavers

1507 search results - page 215 / 302
» Separating Complexity Classes Using Structural Properties
Sort
View
USS
2008
14 years 22 days ago
NetAuth: Supporting User-Based Network Services
In User-Based Network Services (UBNS), the process servicing requests from user U runs under U's ID. This enables (operating system) access controls to tailor service authori...
Manigandan Radhakrishnan, Jon A. Solworth
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
14 years 10 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
PODS
2009
ACM
171views Database» more  PODS 2009»
14 years 11 months ago
XML schema mappings
Relational schema mappings have been extensively studied in connection with data integration and exchange problems, but mappings between XML schemas have not received the same amo...
Shun'ichi Amano, Leonid Libkin, Filip Murlak
ICNP
2006
IEEE
14 years 4 months ago
DPTree: A Balanced Tree Based Indexing Framework for Peer-to-Peer Systems
— Peer-to-peer (P2P) systems have been widely used for exchange of voluminous information and resources among thousands or even millions of users. Since shared data are normally ...
Mei Li, Wang-Chien Lee, Anand Sivasubramaniam
SEMWEB
2010
Springer
13 years 8 months ago
Compact Representation of Large RDF Data Sets for Publishing and Exchange
Abstract. Increasingly huge RDF data sets are being published on the Web. Currently, they use different syntaxes of RDF, contain high levels of redundancy and have a plain indivisi...
Javier D. Fernández, Miguel A. Martí...