Sciweavers

1871 search results - page 345 / 375
» The Ephemeral Pairing Problem
Sort
View
IPSN
2010
Springer
15 years 6 months ago
Bayesian optimization for sensor set selection
We consider the problem of selecting an optimal set of sensors, as determined, for example, by the predictive accuracy of the resulting sensor network. Given an underlying metric ...
Roman Garnett, Michael A. Osborne, Stephen J. Robe...
SIGMOD
2009
ACM
140views Database» more  SIGMOD 2009»
15 years 5 months ago
Robust web extraction: an approach based on a probabilistic tree-edit model
On script-generated web sites, many documents share common HTML tree structure, allowing wrappers to effectively extract information of interest. Of course, the scripts and thus ...
Nilesh N. Dalvi, Philip Bohannon, Fei Sha
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
15 years 5 months ago
Generating labels from clicks
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...
FOCS
2009
IEEE
15 years 5 months ago
Instance-Optimal Geometric Algorithms
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
Peyman Afshani, Jérémy Barbay, Timot...
SEMCO
2009
IEEE
15 years 5 months ago
LexPar: A Freely Available English Paraphrase Lexicon Automatically Extracted from FrameNet
—This is a paper about a new resource, namely an English paraphrase dictionary extracted from the FrameNet lexicon and its example data base. I. THE LEXPAR PARAPHRASE DICTIONARY ...
Bob Coyne, Owen Rambow