Sciweavers

3016 search results - page 338 / 604
» The Online Transportation Problem
Sort
View
MOC
2002
118views more  MOC 2002»
15 years 6 months ago
The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension
Dimensionally unbounded problems are frequently encountered in practice, such as in simulations of stochastic processes, in particle and light transport problems and in the problem...
Fred J. Hickernell, Xiaoqun Wang
TITB
2002
98views more  TITB 2002»
15 years 6 months ago
OILing the way to machine understandable bioinformatics resources
The complex questions and analyses posed by biologists, as well as the diverse data resources they develop, require the fusion of evidence from different, independently developed ...
Robert Stevens, Carole A. Goble, Ian Horrocks, Sea...
WIDM
2006
ACM
16 years 22 days ago
Identifying redundant search engines in a very large scale metasearch engine context
For a given set of search engines, a search engine is redundant if its searchable contents can be found from other search engines in this set. In this paper, we propose a method t...
Ronak Desai, Qi Yang, Zonghuan Wu, Weiyi Meng, Cle...
EUROCRYPT
2004
Springer
15 years 10 months ago
Efficient Private Matching and Set Intersection
We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has m...
Michael J. Freedman, Kobbi Nissim, Benny Pinkas
193
Voted
CEAS
2005
Springer
15 years 8 months ago
Computers beat Humans at Single Character Recognition in Reading based Human Interaction Proofs (HIPs)
Human interaction proofs (HIPs) have become commonplace on the internet for protecting free online services from abuse by automated scripts/bots. They are challenges designed to b...
Kumar Chellapilla, Kevin Larson, Patrice Y. Simard...