250 search results - page 22 / 50 » Verifying Tolerant Systems Using Polynomial Approximations |
FUIN
2000
14 years 9 months ago
2000
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR gra...
ICDM
2008
IEEE
15 years 3 months ago
2008
IEEE
We present Graphite, a system that allows the user to visually construct a query pattern, finds both its exact and approximate matching subgraphs in large attributed graphs, and ...
EUROCAST
2005
Springer
15 years 3 months ago
2005
Springer
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
JSAC
2006
14 years 9 months ago
2006
The symbol error probability (SEP) performance of time-hopping (TH) ultra-wideband (UWB) systems in the presence of multiuser interference (MUI) and timing jitter is considered wit...
FOIKS
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...