The following pages link to Ricard Gavaldà (Q479462):
Displaying 39 items.
- Adaptively learning probabilistic deterministic automata from data streams (Q479463) (← links)
- Self-adaptive utility-based web session management (Q1032320) (← links)
- Strong and robustly strong polynomial-time reducibilities to sparse sets (Q1177170) (← links)
- (Q1261483) (redirect page) (← links)
- A positive relativization of polynomial time versus polylog space (Q1261484) (← links)
- Bounding the expected length of longest common subsequences and forests (Q1293550) (← links)
- The query complexity of learning DFA (Q1336037) (← links)
- Adaptive sampling methods for scaling up knowledge discovery algorithms (Q1597451) (← links)
- A new method of moments for latent variable models (Q1631798) (← links)
- Non-automatizability of bounded-depth Frege proofs (Q1764155) (← links)
- Bounding the complexity of advice functions (Q1894454) (← links)
- Oracles and queries that are sufficient for exact learning (Q1924380) (← links)
- Learning probabilistic automata: a study in state distinguishability (Q1939261) (← links)
- Learning read-constant polynomials of constant degree modulo composites (Q2254504) (← links)
- Learning expressions and programs over monoids (Q2490112) (← links)
- (Q2754140) (← links)
- (Q2762512) (← links)
- Monotone proofs of the pigeon hole principle (Q2765569) (← links)
- Learning Probability Distributions Generated by Finite-State Machines (Q2963596) (← links)
- Learning Read-Constant Polynomials of Constant Degree Modulo Composites (Q3007614) (← links)
- Tractable Clones of Polynomials over Semigroups (Q3524174) (← links)
- Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata (Q3528416) (← links)
- Learning PDFA with Asynchronous Transitions (Q3588386) (← links)
- An Algebraic Perspective on Boolean Function Learning (Q3648753) (← links)
- (Q3812229) (← links)
- (Q3976035) (← links)
- On the Computational Complexity of Small Descriptions (Q4277541) (← links)
- Structural analysis of polynomial-time query learnability (Q4298371) (← links)
- (Q4336266) (← links)
- (Q4336267) (← links)
- Computational power of neural networks: a characterization in terms of Kolmogorov complexity (Q4345611) (← links)
- (Q4348124) (← links)
- (Q4418661) (← links)
- (Q4520312) (← links)
- An efficient closed frequent itemset miner for the MOA stream mining system (Q4589088) (← links)
- (Q4739610) (← links)
- A Lower Bound for Learning Distributions Generated by Probabilistic Automata (Q4930698) (← links)
- (Q4942035) (← links)
- New Computational Paradigms (Q5717033) (← links)
