13214 search results - page 2277 / 2643 » Pseudorandomness for network algorithms |
194
Voted
WWW
2006
ACM
16 years 7 months ago
2006
ACM
Ontologies are at the heart of the semantic web. They define the concepts and relationships that make global interoperability possible. However, as these ontologies grow in size t...
163
click to vote
WWW
2004
ACM
16 years 7 months ago
2004
ACM
This paper presents a search architecture that combines classical search techniques with spread activation techniques applied to a semantic model of a given domain. Given an ontol...
159
click to vote
ESORICS
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. A range of attacks on network components, such as algorithmic denial-of-service attacks and cryptanalysis via timing attacks, are enabled by data structures for which an ...
218
Voted
KDD
2008
ACM
16 years 7 months ago
2008
ACM
Rapid growth in the amount of data available on social networking sites has made information retrieval increasingly challenging for users. In this paper, we propose a collaborativ...
185
Voted
KDD
2007
ACM
16 years 7 months ago
2007
ACM
In many practical applications, one is interested in generating a ranked list of items using information mined from continuous streams of data. For example, in the context of comp...