50 search results - page 10 / 10 » Regular Languages Are Testable with a Constant Number of Que... |
VLDB
2001
ACM
13 years 9 months ago
2001
ACM
We propose an novel method of computing and storing DataCubes. Our idea is to use Bayesian Networks, which can generate approximate counts for any query combination of attribute v...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
BMCBI
2005
13 years 5 months ago
2005
Background: Structural and functional research often requires the computation of sets of protein structures based on certain properties of the proteins, such as sequence features,...
BMCBI
2008
13 years 5 months ago
2008
Background: Much effort is currently made to develop the Gene Ontology (GO). Due to the dynamic nature of information it addresses, GO undergoes constant updates whose results are...
BPSC
2007
13 years 6 months ago
2007
Originally XML was used as a standard protocol for data exchange in computing. The evolution of information technology has opened up new situations in which XML can be used to aut...