Sciweavers

849 search results - page 57 / 170
» The Early Restart Algorithm
Sort
View
ICMCS
2010
IEEE
215views Multimedia» more  ICMCS 2010»
15 years 24 days ago
Efficient search of Top-K video subvolumes for multi-instance action detection
Action detection was formulated as a subvolume mutual information maximization problem in [8], where each subvolume identifies where and when the action occurs in the video. Desp...
Norberto A. Goussies, Zicheng Liu, Junsong Yuan
98
Voted
APLAS
2009
ACM
15 years 5 months ago
Branching Bisimilarity between Finite-State Systems and BPA or Normed BPP Is Polynomial-Time Decidable
In this paper we present polynomial time algorithms deciding branching bisimilarity between finite-state systems and several classes of infinite-state systems: BPA and normed BPP...
Hongfei Fu
SGAI
2004
Springer
15 years 6 months ago
Overfitting in Wrapper-Based Feature Subset Selection: The Harder You Try the Worse it Gets
In Wrapper based feature selection, the more states that are visited during the search phase of the algorithm the greater the likelihood of finding a feature subset that has a high...
John Loughrey, Padraig Cunningham
ICCV
1999
IEEE
16 years 2 months ago
Fast Approximate Energy Minimization via Graph Cuts
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
Yuri Boykov, Olga Veksler, Ramin Zabih
AE
2007
Springer
15 years 6 months ago
The Cooperative Royal Road: Avoiding Hitchhiking
We propose using the so called Royal Road functions as test functions for cooperative co-evolutionary algorithms (CCEAs). The Royal Road functions were created in the early 90’s ...
Gabriela Ochoa, Evelyne Lutton, Edmund K. Burke