2168 search results - page 274 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
130
click to vote
HYBRID
2004
Springer
15 years 9 months ago
2004
Springer
We propose a model for Stochastic Hybrid Systems (SHSs) where transitions between discrete modes are triggered by stochastic events much like transitions between states of a contin...
125
click to vote
IPSN
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. The issue of data association arises frequently in sensor networks; whenever multiple sensors and sources are present, it may be necessary to determine which observations...
128
click to vote
PODS
2000
ACM
15 years 8 months ago
2000
ACM
An estimation algorithm for a query is a probabilistic algorithm that computes an approximation for the size (number of tuples) of the query. One class of estimation algorithms us...
180
click to vote
WSC
2008
15 years 6 months ago
2008
We consider a portfolio allocation problem where the objective function is a tail event such as probability of large portfolio losses. The dependence between assets is captured th...
161
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...