6308 search results - page 221 / 1262 » Modeling Urgency in Timed Systems |
106
click to vote
JPDC
2006
15 years 4 months ago
2006
The nearest-neighbor method can successfully be applied to correct possible errors induced into bit strings transmitted over noisy communication channels or to classify samples in...
121
click to vote
QEST
2006
IEEE
15 years 10 months ago
2006
IEEE
The time-bounded reachability problem for continuoustime Markov chains (CTMCs) amounts to determine the probability to reach a (set of) goal state(s) within a given time span, suc...
122
click to vote
NIPS
2000
15 years 6 months ago
2000
Experimental data show that biological synapses behave quite differently from the symbolic synapses in common artificial neural network models. Biological synapses are dynamic, i....
143
Voted
IPSN
2009
Springer
15 years 11 months ago
2009
Springer
Data Driven Time Synchronization (DDTS) provides synchronization across sensors by using underlying characteristics of data collected by an embedded sensing system. We apply the c...
208
Voted
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
Many computer vision problems can be formulated in
a Bayesian framework with Markov Random Field (MRF)
or Conditional Random Field (CRF) priors. Usually, the
model assumes that ...