Sciweavers

922 search results - page 112 / 185
» On a Generalization of the Stone-Weierstrass Theorem
Sort
View
ICML
1999
IEEE
16 years 7 months ago
Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
Rajesh Parekh, Vasant Honavar
WWW
2008
ACM
16 years 6 months ago
Scalable querying services over fuzzy ontologies
Fuzzy ontologies are envisioned to be useful in the Semantic Web. Existing fuzzy ontology reasoners are not scalable enough to handle the scale of data that the Web provides. In t...
Jeff Z. Pan, Giorgos B. Stamou, Giorgos Stoilos, S...
STOC
2009
ACM
143views Algorithms» more  STOC 2009»
16 years 6 months ago
Affine dispersers from subspace polynomials
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
Eli Ben-Sasson, Swastik Kopparty
RECOMB
2007
Springer
16 years 6 months ago
Beyond Galled Trees - Decomposition and Computation of Galled Networks
Reticulate networks are a type of phylogenetic network that are used to represent reticulate evolution involving hybridization, horizontal gene transfer or recombination. The simpl...
Daniel H. Huson, Tobias H. Klöpper
CADE
2002
Springer
16 years 6 months ago
Reasoning by Symmetry and Function Ordering in Finite Model Generation
Abstract. Finite model search for first-order logic theories is complementary to theorem proving. Systems like Falcon, SEM and FMSET use the known LNH (Least Number Heuristic) heur...
Gilles Audemard, Belaid Benhamou