Sciweavers

4432 search results - page 646 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
AI
1999
Springer
15 years 15 days ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter
IR
2010
14 years 11 months ago
Adapting boosting for information retrieval measures
Abstract We present a new ranking algorithm that combines the strengths of two previous methods: boosted tree classification, and LambdaRank, which has been shown to be empiricall...
Qiang Wu, Christopher J. C. Burges, Krysta Marie S...
128
Voted
CORR
2010
Springer
198views Education» more  CORR 2010»
14 years 9 months ago
Convex Graph Invariants
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
Venkat Chandrasekaran, Pablo A. Parrilo, Alan S. W...
134
Voted
GECCO
2011
Springer
248views Optimization» more  GECCO 2011»
14 years 4 months ago
Size-based tournaments for node selection
In genetic programming, the reproductive operators of crossover and mutation both require the selection of nodes from the reproducing individuals. Both unbiased random selection a...
Thomas Helmuth, Lee Spector, Brian Martin
117
Voted
IJON
2011
186views more  IJON 2011»
14 years 4 months ago
Discriminative structure selection method of Gaussian Mixture Models with its application to handwritten digit recognition
, Yunde Jia Model structure selection is currently an open problem in modeling data via Gaussian Mixture Models (GMM). This paper proposes a discriminative method to select GMM st...
Xuefeng Chen, Xiabi Liu, Yunde Jia