Sciweavers

507 search results - page 90 / 102
» Sizes of Ordered Decision Trees
Sort
View
RTCSA
1999
IEEE
14 years 19 hour ago
A Symbolic Model Checker for Testing ASTRAL Real-Time Specifications
ASTRAL is a high-level formal specification language for real-time (infinite state) systems. It is provided with structuring mechanisms that allow one to build modularized specifi...
Zhe Dang, Richard A. Kemmerer
BMCBI
2004
115views more  BMCBI 2004»
13 years 7 months ago
An SVD-based comparison of nine whole eukaryotic genomes supports a coelomate rather than ecdysozoan lineage
Background: Eukaryotic whole genome sequences are accumulating at an impressive rate. Effective methods for comparing multiple whole eukaryotic genomes on a large scale are needed...
Gary W. Stuart, Michael W. Berry
KAIS
2006
247views more  KAIS 2006»
13 years 7 months ago
XCQ: A queriable XML compression system
XML has already become the de facto standard for specifying and exchanging data on the Web. However, XML is by nature verbose and thus XML documents are usually large in size, a fa...
Wilfred Ng, Wai Yeung Lam, Peter T. Wood, Mark Lev...
VMCAI
2010
Springer
14 years 5 months ago
Building a Calculus of Data Structures
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
Viktor Kuncak, Ruzica Piskac, Philippe Suter, Thom...
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
14 years 2 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel