Sciweavers

1763 search results - page 223 / 353
» A Formalization of Polytime Functions
Sort
View
CSFW
2012
IEEE
13 years 13 days ago
Provably Secure and Practical Onion Routing
The onion routing network Tor is undoubtedly the most widely employed technology for anonymous web access. Although the underlying onion routing (OR) protocol appears satisfactory...
Michael Backes, Ian Goldberg, Aniket Kate, Esfandi...
SDM
2012
SIAM
252views Data Mining» more  SDM 2012»
13 years 12 days ago
Learning from Heterogeneous Sources via Gradient Boosting Consensus
Multiple data sources containing different types of features may be available for a given task. For instance, users’ profiles can be used to build recommendation systems. In a...
Xiaoxiao Shi, Jean-François Paiement, David...
VLDB
2007
ACM
114views Database» more  VLDB 2007»
15 years 10 months ago
XRPC: Interoperable and Efficient Distributed XQuery
We propose XRPC, a minimal XQuery extension that enables distributed yet efficient querying of heterogeneous XQuery data sources. XRPC enhances the existing concept of XQuery func...
Ying Zhang, Peter A. Boncz
VISUALIZATION
1994
IEEE
15 years 2 months ago
A Lattice Model for Data Display
We will try to address the need for a formal foundation for visualization by taking an analytic approach to defining D. Since an arbitrary function D: U V will not produce display...
William L. Hibbard, Charles R. Dyer, Brian E. Paul
PKC
2000
Springer
166views Cryptology» more  PKC 2000»
15 years 1 months ago
Design Validations for Discrete Logarithm Based Signature Schemes
A number of signature schemes and standards have been recently designed, based on the Discrete Logarithm problem. In this paper we conduct design validation of such schemes while t...
Ernest F. Brickell, David Pointcheval, Serge Vaude...