Sciweavers

5138 search results - page 135 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
IJON
2010
199views more  IJON 2010»
14 years 11 months ago
DFS-generated pathways in GA crossover for protein structure prediction
Genetic Algorithms (GAs), as nondeterministic conformational search techniques, are promising for solving protein structure prediction (PSP) problems. The crossover operator of a ...
Tamjidul Hoque, Madhu Chetty, Andrew Lewis, Abdul ...
183
Voted
CVPR
2011
IEEE
14 years 9 months ago
Learning Context for Collective Activity Recognition
In this paper we present a framework for the recognition of collective human activities. A collective activity is defined or reinforced by the existence of coherent behavior of i...
Wongun Choi, Silvio Savarese, Khuram Shahid
SODA
2012
ACM
249views Algorithms» more  SODA 2012»
13 years 4 months ago
Improved competitive ratio for the matroid secretary problem
The Matroid Secretary Problem, introduced by Babaioff et al. (2007), is a generalization of the Classical Secretary Problem. In this problem, elements from a matroid are presente...
Sourav Chakraborty, Oded Lachish
ECML
2006
Springer
15 years 5 months ago
Multiple-Instance Learning Via Random Walk
This paper presents a decoupled two stage solution to the multiple-instance learning (MIL) problem. With a constructed affinity matrix to reflect the instance relations, a modified...
Dong Wang, Jianmin Li, Bo Zhang
AAAI
1998
15 years 3 months ago
Which Search Problems Are Random?
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
Tad Hogg