Sciweavers

68 search results - page 7 / 14
» A Probabilistic Ensemble Pruning Algorithm
Sort
View
VLDB
2004
ACM
98views Database» more  VLDB 2004»
14 years 22 days ago
Top-k Query Evaluation with Probabilistic Guarantees
Top-k queries based on ranking elements of multidimensional datasets are a fundamental building block for many kinds of information discovery. The best known general-purpose algor...
Martin Theobald, Gerhard Weikum, Ralf Schenkel
ISCIS
2005
Springer
14 years 27 days ago
An Investigation of the Course-Section Assignment Problem
Abstract. We investigate the problem of enumerating schedules, consisting of course-section assignments, in increasing order of the number of conflicts they contain. We define th...
Zeki Bayram
AAAI
2011
12 years 7 months ago
Coarse-to-Fine Inference and Learning for First-Order Probabilistic Models
Coarse-to-fine approaches use sequences of increasingly fine approximations to control the complexity of inference and learning. These techniques are often used in NLP and visio...
Chloe Kiddon, Pedro Domingos
INLG
2004
Springer
14 years 22 days ago
Reining in CCG Chart Realization
Abstract. We present a novel ensemble of six methods for improving the efficiency of chart realization. The methods are couched in the framework of Combinatory Categorial Grammar (...
Michael White
CVPR
1998
IEEE
14 years 9 months ago
Joint Probabilistic Techniques for Tracking Multi-Part Objects
Common objects such as people and cars comprise many visual parts and attributes, yet image-based tracking algorithms are often keyed to only one of a target's identifying ch...
Christopher Rasmussen, Gregory D. Hager