Sciweavers

1449 search results - page 139 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
CVPR
2012
IEEE
13 years 8 months ago
Sum-product networks for modeling activities with stochastic structure
This paper addresses recognition of human activities with stochastic structure, characterized by variable spacetime arrangements of primitive actions, and conducted by a variable ...
Mohamed R. Amer, Sinisa Todorovic
ALT
2004
Springer
16 years 3 months ago
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
Mark Herbster
CEC
2007
IEEE
16 years 21 days ago
On the analysis of average time complexity of estimation of distribution algorithms
— Estimation of Distribution Algorithm (EDA) is a well-known stochastic optimization technique. The average time complexity is a crucial criterion that measures the performance o...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao
PODC
2009
ACM
16 years 6 months ago
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
Riko Jacob, Andréa W. Richa, Christian Sche...
INFOCOM
2006
IEEE
16 years 11 days ago
Impact of Human Mobility on the Design of Opportunistic Forwarding Algorithms
— Studying transfer opportunities between wireless devices carried by humans, we observe that the distribution of the inter-contact time, that is the time gap separating two cont...
Augustin Chaintreau, Pan Hui, Jon Crowcroft, Chris...