Sciweavers

2252 search results - page 69 / 451
» Improving Random Forests
Sort
View
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 6 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á...
VLSISP
2010
106views more  VLSISP 2010»
13 years 6 months ago
A Multi-Pronged Approach to Improving Semantic Extraction of News Video
In this paper we describe a multi-strategy approach to improving semantic extraction from news video. Experiments show the value of careful parameter tuning, exploiting multiple fe...
Alexander G. Hauptmann, Ming-yu Chen, Michael G. C...
PKC
2012
Springer
235views Cryptology» more  PKC 2012»
11 years 10 months ago
Improved Security for Linearly Homomorphic Signatures: A Generic Framework
ded abstract of this work will appear in Public Key Cryptography — PKC 2012. This is the full version. We propose a general framework that converts (ordinary) signature schemes ...
David Mandell Freeman
ECCV
2002
Springer
14 years 10 months ago
Dynamic Trees: Learning to Model Outdoor Scenes
Abstract. This paper considers the dynamic tree (DT) model, first introduced in [1]. A dynamic tree specifies a prior over structures of trees, each of which is a forest of one or ...
Nicholas J. Adams, Christopher K. I. Williams
EMNLP
2008
13 years 9 months ago
Forest-based Translation Rule Extraction
Translation rule extraction is a fundamental problem in machine translation, especially for linguistically syntax-based systems that need parse trees from either or both sides of ...
Haitao Mi, Liang Huang