Sciweavers

4007 search results - page 623 / 802
» Computation with imprecise probabilities
Sort
View
129
Voted
CIKM
2004
Springer
15 years 9 months ago
Approximating the top-m passages in a parallel question answering system
We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
Charles L. A. Clarke, Egidio L. Terra
131
Voted
DRM
2004
Springer
15 years 9 months ago
Tamper detection and localization for categorical data using fragile watermarks
Today, database relations are widely used and distributed over the Internet. Since these data can be easily tampered with, it is critical to ensure the integrity of these data. In...
Yingjiu Li, Huiping Guo, Sushil Jajodia
ECAI
2004
Springer
15 years 9 months ago
Automatic Recognition of Famous Artists by Machine
The paper addresses the question whether it is possible for a machine to learn to distinguish and recognise famous musicians (concert pianists), based on their style of playing. We...
Gerhard Widmer, Patrick Zanon
GECCO
2004
Springer
138views Optimization» more  GECCO 2004»
15 years 9 months ago
Exploratory Data Analysis with Interactive Evolution
We illustrate with two simple examples how Interactive Evolutionary Computation (IEC) can be applied to Exploratory Data Analysis (EDA). IEC is particularly valuable in an EDA cont...
Sergey Malinchik, Eric Bonabeau
ICALP
2004
Springer
15 years 9 months ago
Group Spreading: A Protocol for Provably Secure Distributed Name Service
In order to enable communication between a dynamic collection of peers with given ID’s, such as “machine.cs.school.edu”, over the Internet, a distributed name service must b...
Baruch Awerbuch, Christian Scheideler