Sciweavers

1950 search results - page 87 / 390
» Varieties of Increasing Trees
Sort
View
ICML
2007
IEEE
14 years 10 months ago
Learning for efficient retrieval of structured data with noisy queries
Increasingly large collections of structured data necessitate the development of efficient, noise-tolerant retrieval tools. In this work, we consider this issue and describe an ap...
Charles Parker, Alan Fern, Prasad Tadepalli
ICML
2008
IEEE
14 years 10 months ago
An empirical evaluation of supervised learning in high dimensions
In this paper we perform an empirical evaluation of supervised learning on highdimensional data. We evaluate performance on three metrics: accuracy, AUC, and squared loss and stud...
Rich Caruana, Nikolaos Karampatziakis, Ainur Yesse...
HM
2007
Springer
137views Optimization» more  HM 2007»
14 years 4 months ago
A Hybrid VNS for Connected Facility Location
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
Ivana Ljubic
PVLDB
2010
136views more  PVLDB 2010»
13 years 8 months ago
SigMatch: Fast and Scalable Multi-Pattern Matching
Multi-pattern matching involves matching a data item against a large database of “signature” patterns. Existing algorithms for multipattern matching do not scale well as the s...
Ramakrishnan Kandhan, Nikhil Teletia, Jignesh M. P...
MLQ
2008
106views more  MLQ 2008»
13 years 10 months ago
A general Mitchell style iteration
We work out the details of a schema for a mixed support forcing iteration, which generalizes the Mitchell model [7] with no Aronszajn trees on 2. The main purpose of this paper is ...
John Krueger