Sciweavers

3422 search results - page 116 / 685
» Random Subset Optimization
Sort
View
CVPR
2009
IEEE
16 years 10 months ago
Max-Margin Hidden Conditional Random Fields for Human Action Recognition
We present a new method for classification with structured latent variables. Our model is formulated using the max-margin formalism in the discriminative learning literature. We...
Yang Wang 0003, Greg Mori
104
Voted
WEA
2007
Springer
125views Algorithms» more  WEA 2007»
15 years 8 months ago
Simple Compression Code Supporting Random Access and Fast String Matching
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
Kimmo Fredriksson, Fedor Nikitin
GECCO
2005
Springer
141views Optimization» more  GECCO 2005»
15 years 8 months ago
Behavior of finite population variable length genetic algorithms under random selection
In this work we provide empirical evidence that shows how a variable-length genetic algorithm (GA) can naturally evolve shorter average size populations. This reduction in chromos...
Hal Stringer, Annie S. Wu
106
Voted
CORR
2007
Springer
82views Education» more  CORR 2007»
15 years 2 months ago
Sorting and Selection with Random Costs
There is a growing body of work on sorting and selection in models other than the unit-cost comparison model. This work treats a natural stochastic variant of the problem where the...
Stanislav Angelov, Keshav Kunal, Andrew McGregor
123
Voted
TOG
2008
103views more  TOG 2008»
15 years 2 months ago
Sketch-based tree modeling using Markov random field
In this paper, we describe a new system for converting a user's freehand sketch of a tree into a full 3D model that is both complex and realistic-looking. Our system does thi...
Xuejin Chen, Boris Neubert, Ying-Qing Xu, Oliver D...