916 search results - page 138 / 184 » Using redundancies to find errors |
AAAI
1996
14 years 11 months ago
1996
The Airport Example The Omelette Example Copyright c 1996 American Association for Artificial Intelligence. All rights reserved. Despite the existence of programs that are able to ...
CORR
2004
Springer
14 years 9 months ago
2004
Springer
Mapping the Internet generally consists in sampling the network from a limited set of sources by using traceroute-like probes. This methodology, akin to the merging of different s...
102
click to vote
TIT
2008
14 years 9 months ago
2008
Distributed estimation of an unknown signal is a common task in sensor networks. The scenario usually envisioned consists of several nodes, each making an observation correlated wi...
FOCS
1999
IEEE
15 years 2 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
VLDB
1998
ACM
15 years 1 months ago
1998
ACM
We consider the problem of finding association rules that make nearly optimal binary segmentations of huge categorical databases. The optimality of segmentation is defined by an o...