Sciweavers

2566 search results - page 261 / 514
» The Online Median Problem
Sort
View
CORR
2010
Springer
94views Education» more  CORR 2010»
15 years 5 months ago
When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
Nikhil Bansal, Anupam Gupta, Jian Li, Juliá...
WIDM
2006
ACM
16 years 18 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...
181
Voted
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
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...
DAS
2008
Springer
15 years 8 months ago
MathBrush: A System for Doing Math on Pen-Based Devices
Many on-line (interactive) mathematics recognition systems allow the creation of typeset equations, normally in LaTeX, but they do not support mathematical problem solving. In thi...
George Labahn, Edward Lank, Scott MacLean, Mirette...