Sciweavers

7106 search results - page 289 / 1422
» Restricted Complexity, General Complexity
Sort
View
CORR
2009
Springer
91views Education» more  CORR 2009»
15 years 2 months ago
On the Number of Membranes in Unary P Systems
We consider P systems with a linear membrane structure working on objects over a unary alphabet using sets of rules resembling homomorphisms. Such a restricted variant of P systems...
Rudolf Freund, Andreas Klein, Martin Kutrib
DLOG
2011
14 years 8 months ago
Nominal Schemas for Integrating Rules and Description Logics
We propose an extension of SROIQ with nominal schemas which can be used like “variable nominal concepts” within axioms. This feature allows us to express arbitrary DL-safe rule...
Markus Krötzsch, Frederick Maier, Adila Alfa ...
ICML
2007
IEEE
16 years 5 months ago
Sample compression bounds for decision trees
We propose a formulation of the Decision Tree learning algorithm in the Compression settings and derive tight generalization error bounds. In particular, we propose Sample Compres...
Mohak Shah
APPROX
2004
Springer
108views Algorithms» more  APPROX 2004»
15 years 10 months ago
Estimating Frequency Moments of Data Streams Using Random Linear Combinations
The problem of estimating the kth frequency moment Fk for any nonnegative k, over a data stream by looking at the items exactly once as they arrive, was considered in a seminal pap...
Sumit Ganguly
ANTS
2006
Springer
127views Algorithms» more  ANTS 2006»
15 years 8 months ago
Doubly-Focused Enumeration of Pseudosquares and Pseudocubes
This paper offers numerical evidence for a conjecture that primality proving may be done in (log N)3+o(1) operations by examining the growth rate of quantities known as pseudosquar...
Kjell Wooding, Hugh C. Williams