Sciweavers

5115 search results - page 415 / 1023
» On Randomized Lanczos Algorithms
Sort
View
IJON
2010
199views more  IJON 2010»
15 years 4 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 ...
CVPR
2011
IEEE
15 years 3 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
JMLR
2010
149views more  JMLR 2010»
15 years 2 months ago
Coherent Inference on Optimal Play in Game Trees
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
Philipp Hennig, David H. Stern, Thore Graepel
PODC
2009
ACM
16 years 7 days ago
Brief announcement: locality-based aggregate computation in wireless sensor networks
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...
Jen-Yeu Chen, Gopal Pandurangan, Jianghai Hu
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
16 years 7 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah