Sciweavers

6906 search results - page 81 / 1382
» An algorithm for modelling key terms
Sort
View
WSDM
2012
ACM
290views Data Mining» more  WSDM 2012»
13 years 11 months ago
Online selection of diverse results
The phenomenal growth in the volume of easily accessible information via various web-based services has made it essential for service providers to provide users with personalized ...
Debmalya Panigrahi, Atish Das Sarma, Gagan Aggarwa...
AAAI
2007
15 years 6 months ago
Adaptive Traitor Tracing with Bayesian Networks
The practical success of broadcast encryption hinges on the ability to (1) revoke the access of compromised keys and (2) determine which keys have been compromised. In this work w...
Philip Zigoris, Hongxia Jin
158
Voted
WDAG
2001
Springer
131views Algorithms» more  WDAG 2001»
15 years 8 months ago
The Complexity of Synchronous Iterative Do-All with Crashes
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
Chryssis Georgiou, Alexander Russell, Alexander A....
138
Voted
KES
1999
Springer
15 years 8 months ago
Parallel genetic algorithm taxonomy
—Genetic Algorithms (GAs) are powerful search techniques that are used to solve difficult problems in many disciplines. Unfortunately, they can be very demanding in terms of com...
Mariusz Nowostawski, Riccardo Poli
ALGORITHMICA
2010
106views more  ALGORITHMICA 2010»
15 years 4 months ago
Analysis of the Expected Number of Bit Comparisons Required by Quickselect
When algorithms for sorting and searching are applied to keys that are represented as bit strings, we can quantify the performance of the algorithms not only in terms of the numbe...
James Allen Fill, Takéhiko Nakama