Sciweavers

4324 search results - page 42 / 865
» A Generalized Representer Theorem
Sort
View
94
Voted
JSYML
2006
98views more  JSYML 2006»
15 years 20 days ago
On weak and strong interpolation in algebraic logics
We show that there is a restriction, or modification of the finite-variable fragments of First Order Logic in which a weak form of Craig's Interpolation Theorem holds but a s...
Saharon Shelah, Gábor Sági
118
Voted
ACL2
2006
ACM
15 years 6 months ago
Phylogenetic trees in ACL2
Biologists studying the evolutionary relationships between organisms use software packages to solve the computational problems they encounter. Several of these problems involve th...
Warren A. Hunt Jr., Serita M. Nelesen
104
Voted
WWW
2008
ACM
16 years 1 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...
69
Voted
DM
2006
73views more  DM 2006»
15 years 22 days ago
Contributions to zero-sum problems
A prototype of zero-sum theorems, the well-known theorem of Erdos, Ginzburg and Ziv says that for any positive integer n, any sequence a1, a2, . . . , a2n-1 of 2n-1 integers has a...
Sukumar Das Adhikari, Yong-Gao Chen, John Friedlan...
ISSAC
2009
Springer
123views Mathematics» more  ISSAC 2009»
15 years 7 months ago
Schemes for deterministic polynomial factoring
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...
Gábor Ivanyos, Marek Karpinski, Nitin Saxen...