Sciweavers

1159 search results - page 103 / 232
» On relevance distributions
Sort
View
PKC
2004
Springer
95views Cryptology» more  PKC 2004»
15 years 11 months ago
A Nonuniform Algorithm for the Hidden Number Problem in Subgroups
Boneh and Venkatesan have proposed a polynomial time algorithm in a non-uniform model for recovering a ”hidden” element α ∈ IFp, where p is prime, from very short strings of...
Igor Shparlinski, Arne Winterhof
SEMWEB
2004
Springer
15 years 11 months ago
How to Build Google2Google - An (Incomplete) Recipe
Abstract. This talk explores aspects relevant for peer-to-peer search infrastructures, which we think are better suited to semantic web search than centralized approaches. It does ...
Wolfgang Nejdl
EDOC
2003
IEEE
15 years 11 months ago
An Efficient, Scalable Content-Based Messaging System
Large-scale information processing environments must rapidly search through massive streams of raw data to locate useful information. These data streams contain textual and numeri...
Ian Gorton, Justin Almquist, Nick Cramer, Jereme H...
WORDS
2003
IEEE
15 years 11 months ago
Asynchrony and Real-Time Dependable Computing
We examine how computer system problems can be derived from real application problems, with a particular focus on the relevance of some assumptions, especially those related to co...
Gérard Le Lann
SAC
2003
ACM
15 years 11 months ago
Ontology-Focused Crawling of Web Documents
The Web, the largest unstructured database of the world, has greatly improved access to documents. However, documents on the Web are largely disorganized. Due to the distributed n...
Marc Ehrig, Alexander Maedche