Sciweavers

13026 search results - page 2167 / 2606
» Probabilistic Relational Models
Sort
View
SPW
2004
Springer
16 years 6 days ago
Privacy Is Linking Permission to Purpose
Abstract Fabio Massacci1 and Nicola Zannone1 Department of Information and Communication Technology University of Trento - Italy {massacci,zannone} at dit.unitn.it The last years h...
Fabio Massacci, Nicola Zannone
WAW
2004
Springer
150views Algorithms» more  WAW 2004»
16 years 6 days ago
Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations
d Abstract) Paolo Boldi† Massimo Santini‡ Sebastiano Vigna∗ Deciding which kind of visit accumulates high-quality pages more quickly is one of the most often debated issue i...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
FOCS
2003
IEEE
16 years 5 days ago
General Composition and Universal Composability in Secure Multi-Party Computation
Concurrent general composition relates to a setting where a secure protocol is run in a network concurrently with other, arbitrary protocols. Clearly, security in such a setting i...
Yehuda Lindell
SIGMETRICS
2003
ACM
119views Hardware» more  SIGMETRICS 2003»
16 years 3 days ago
Incrementally improving lookup latency in distributed hash table systems
Distributed hash table (DHT) systems are an important class of peer-to-peer routing infrastructures. They enable scalable wide-area storage and retrieval of information, and will ...
Hui Zhang 0002, Ashish Goel, Ramesh Govindan
COOPIS
2002
IEEE
15 years 12 months ago
Formal Ontology Engineering in the DOGMA Approach
This paper presents a specifically database-inspired approach (called DOGMA) for engineering formal ontologies, implemented as shared resources used to express agreed formal semant...
Mustafa Jarrar, Robert Meersman
« Prev « First page 2167 / 2606 Last » Next »