Sciweavers

811 search results - page 103 / 163
» Avoiding Approximate Squares
Sort
View
ECIR
2010
Springer
13 years 9 months ago
Learning to Distribute Queries into Web Search Nodes
Web search engines are composed of a large set of search nodes and a broker machine that feeds them with queries. A location cache keeps minimal information in the broker to regist...
Marcelo Mendoza, Mauricio Marín, Flavio Fer...
CC
2006
Springer
125views System Software» more  CC 2006»
13 years 9 months ago
A tight lower bound for restricted pir protocols
We show that any 1-round 2-server Private Information Retrieval Protocol where the answers are 1-bit long must ask questions that are at least n - 2 bits long, which is nearly equa...
Richard Beigel, Lance Fortnow, William I. Gasarch
ENTCS
2006
151views more  ENTCS 2006»
13 years 9 months ago
Stochastic Simulation Methods Applied to a Secure Electronic Voting Model
We demonstrate a novel simulation technique for analysing large stochastic process algebra models, applying this to a secure electronic voting system example. By approximating the...
Jeremy T. Bradley, Stephen T. Gilmore
TNN
2008
82views more  TNN 2008»
13 years 9 months ago
Deterministic Learning for Maximum-Likelihood Estimation Through Neural Networks
In this paper, a general method for the numerical solution of maximum-likelihood estimation (MLE) problems is presented; it adopts the deterministic learning (DL) approach to find ...
Cristiano Cervellera, Danilo Macciò, Marco ...
NN
1998
Springer
156views Neural Networks» more  NN 1998»
13 years 8 months ago
Automatic early stopping using cross validation: quantifying the criteria
Cross validation can be used to detect when over tting starts during supervised training of a neural network; training is then stopped before convergence to avoid the overtting  ...
Lutz Prechelt