Sciweavers

3204 search results - page 484 / 641
» Online Learning with Constraints
Sort
View
226
Voted
ICCV
2011
IEEE
14 years 7 months ago
Strong Supervision From Weak Annotation: Interactive Training of Deformable Part Models
We propose a framework for large scale learning and annotation of structured models. The system interleaves interactive labeling (where the current model is used to semiautomate t...
Steven Branson, Pietro Perona, Serge Belongie
210
Voted
SOSP
2009
ACM
16 years 3 months ago
Quincy: fair scheduling for distributed computing clusters
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
Michael Isard, Vijayan Prabhakaran, Jon Currey, Ud...
205
Voted
SARA
2005
Springer
16 years 15 days ago
Approximate Model-Based Diagnosis Using Preference-Based Compilation
Abstract. This article introduces a technique for improving the efficiency of diagnosis through approximate compilation. We extend the approach of compiling a diagnostic model, as...
Gregory M. Provan
SIGMOD
2010
ACM
267views Database» more  SIGMOD 2010»
15 years 12 months ago
Processing proximity relations in road networks
Applications ranging from location-based services to multi-player online gaming require continuous query support to monitor, track, and detect events of interest among sets of mov...
Zhengdao Xu, Hans-Arno Jacobsen
211
Voted
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
16 years 7 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen