Sciweavers

20807 search results - page 178 / 4162
» How to read a paper
Sort
View
SIGIR
2010
ACM
15 years 10 months ago
How good is a span of terms?: exploiting proximity to improve web retrieval
Ranking search results is a fundamental problem in information retrieval. In this paper we explore whether the use of proximity and phrase information can improve web retrieval ac...
Krysta Marie Svore, Pallika H. Kanani, Nazan Khan
COCO
2006
Springer
100views Algorithms» more  COCO 2006»
15 years 10 months ago
How to Get More Mileage from Randomness Extractors
Let C be a class of distributions over {0, 1}n . A deterministic randomness extractor for C is a function E : {0, 1}n {0, 1}m such that for any X in C the distribution E(X) is sta...
Ronen Shaltiel
CTRSA
2006
Springer
157views Cryptology» more  CTRSA 2006»
15 years 10 months ago
How to Construct Multicast Cryptosystems Provably Secure Against Adaptive Chosen Ciphertext Attack
Abstract. In this paper we present a general framework for constructing efficient multicast cryptosystems with provable security and show that a line of previous work on multicast ...
Yitao Duan, John F. Canny
ECAI
2006
Springer
15 years 10 months ago
Knowledge Engineering for Bayesian Networks: How Common Are Noisy-MAX Distributions in Practice?
One problem faced in knowledge engineering for Bayesian networks is the exponential growth of the number of parameters in their conditional probability tables (CPTs). The most comm...
Adam Zagorecki, Marek J. Druzdzel
GECCO
2006
Springer
134views Optimization» more  GECCO 2006»
15 years 10 months ago
PSO and multi-funnel landscapes: how cooperation might limit exploration
Particle Swarm Optimization (PSO) is a population-based optimization method in which search points employ a cooperative strategy to move toward one another. In this paper we show ...
Andrew M. Sutton, Darrell Whitley, Monte Lunacek, ...