Sciweavers

2479 search results - page 437 / 496
» Random Event Structures
Sort
View
CORR
2008
Springer
90views Education» more  CORR 2008»
13 years 7 months ago
A computationally-efficient construction for the matrix-based key distribution in sensor network
Key pre-distribution in wireless sensor network is aimed at delivering keys to sensor networks at the low expense of computation, communication, and memory while providing a high d...
Abedelaziz Mohaisen
ECCC
2010
95views more  ECCC 2010»
13 years 7 months ago
Bounded-depth circuits cannot sample good codes
We study a variant of the classical circuit-lower-bound problems: proving lower bounds for sampling distributions given random bits. We prove a lower bound of 1 - 1/n(1) on the st...
Shachar Lovett, Emanuele Viola
CVIU
2006
222views more  CVIU 2006»
13 years 7 months ago
Conditional models for contextual human motion recognition
We present algorithms for recognizing human motion in monocular video sequences, based on discriminative Conditional Random Field (CRF) and Maximum Entropy Markov Models (MEMM). E...
Cristian Sminchisescu, Atul Kanaujia, Dimitris N. ...
JCC
2008
166views more  JCC 2008»
13 years 7 months ago
Reference energy extremal optimization: A stochastic search algorithm applied to computational protein design
: We adapt a combinatorial optimization algorithm, extremal optimization (EO), for the search problem in computational protein design. This algorithm takes advantage of the knowled...
Naigong Zhang, Chen Zeng
JPDC
2008
129views more  JPDC 2008»
13 years 7 months ago
A framework for scalable greedy coloring on distributed-memory parallel computers
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
Doruk Bozdag, Assefaw Hadish Gebremedhin, Fredrik ...