Sciweavers

185 search results - page 15 / 37
» Local Monotonicity in Probabilistic Networks
Sort
View
ICMLA
2008
13 years 8 months ago
Probabilistic Exploitation of the Lucas and Kanade Smoothness Constraint
The basic idea of Lucas and Kanade is to constrain the local motion measurement by assuming a constant velocity within a spatial neighborhood. We reformulate this spatial constrai...
Volker Willert, Julian Eggert, Marc Toussaint, Edg...
ADHOCNOW
2004
Springer
14 years 25 days ago
Weathering the Storm: Managing Redundancy and Security in Ad Hoc Networks
Many ad hoc routing algorithms rely on broadcast flooding for location discovery or more generally for secure routing applications, particularly when dealing with Byzantine threat...
Mike Burmester, Tri Van Le, Alec Yasinsac
ICCAD
2003
IEEE
127views Hardware» more  ICCAD 2003»
14 years 4 months ago
A Probabilistic-Based Design Methodology for Nanoscale Computation
As current silicon-based techniques fast approach their practical limits, the investigation of nanoscale electronics, devices and system architectures becomes a central research p...
R. Iris Bahar, Joseph L. Mundy, Jie Chen
CCGRID
2008
IEEE
13 years 9 months ago
A Probabilistic Model to Analyse Workflow Performance on Production Grids
Production grids are complex and highly variable systems whose behavior is not well understood and difficult to anticipate. The goal of this study is to estimate the impact of the ...
Tristan Glatard, Johan Montagnat, Xavier Pennec
IPL
2006
72views more  IPL 2006»
13 years 7 months ago
Cayley graphs as models of deterministic small-world networks
Many real networks, including those in social, technological, and biological realms, are small-world networks. The two distinguishing characteristics of small-world networks are h...
Wenjun Xiao, Behrooz Parhami