2009 |
52 | EE | Ramon Ferrer-i-Cancho,
Ricard Gavaldà:
The frequency spectrum of finite samples from the intermittent silence process.
JASIST 60(4): 837-843 (2009) |
2008 |
51 | EE | Josep Lluis Berral,
Nicolas Poggi,
Javier Alonso,
Ricard Gavaldà,
Jordi Torres,
Manish Parashar:
Adaptive distributed mechanism against flooding network attacks based on machine learning.
AISec 2008: 43-50 |
50 | EE | Jorge Castro,
Ricard Gavaldà:
Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata.
ICGI 2008: 163-174 |
49 | EE | Jordi Torres,
David Carrera,
Kevin Hogan,
Ricard Gavaldà,
Vicenç Beltran,
Nicolas Poggi:
Reducing wasted resources to help achieve green data centers.
IPDPS 2008: 1-8 |
48 | EE | Albert Bifet,
Ricard Gavaldà:
Mining adaptively frequent closed unlabeled rooted trees in data streams.
KDD 2008: 34-42 |
2007 |
47 | EE | Albert Bifet,
Ricard Gavaldà:
Learning from Time-Changing Data with Adaptive Windowing.
SDM 2007 |
46 | EE | Nicolas Poggi,
Toni Moreno,
Josep Lluis Berral,
Ricard Gavaldà,
Jordi Torres:
Web Customer Modeling for Automated Session Prioritization on High Traffic Sites.
User Modeling 2007: 450-454 |
2006 |
45 | EE | Albert Bifet,
Ricard Gavaldà:
Kalman Filters and Adaptive Windows for Learning in Data Streams.
Discovery Science 2006: 29-40 |
44 | EE | Ricard Gavaldà,
Philipp W. Keller,
Joelle Pineau,
Doina Precup:
PAC-Learning of Markov Models with Hidden State.
ECML 2006: 150-161 |
43 | EE | Ricard Gavaldà,
Pascal Tesson,
Denis Thérien:
Learning expressions and programs over monoids.
Inf. Comput. 204(2): 177-209 (2006) |
42 | EE | Ricard Gavaldà,
Eiji Takimoto:
Foreword.
Theor. Comput. Sci. 364(1): 1-2 (2006) |
2005 |
41 | EE | Víctor Dalmau,
Ricard Gavaldà,
Pascal Tesson,
Denis Thérien:
Tractable Clones of Polynomials over Semigroups.
CP 2005: 196-210 |
40 | EE | Ricard Gavaldà:
An Algebraic View on Exact Learning from Queries.
CiE 2005: 150-151 |
39 | EE | Víctor Dalmau,
Ricard Gavaldà,
Pascal Tesson,
Denis Thérien:
Tractable Clones of Polynomials over Semigroups
Electronic Colloquium on Computational Complexity (ECCC)(059): (2005) |
2004 |
38 | EE | Maria Luisa Bonet,
Carlos Domingo,
Ricard Gavaldà,
Alexis Maciel,
Toniann Pitassi:
Non-Automatizability of Bounded-Depth Frege Proofs.
Computational Complexity 13(1-2): 47-68 (2004) |
2003 |
37 | | Ricard Gavaldà,
Klaus P. Jantke,
Eiji Takimoto:
Algorithmic Learning Theory, 14th International Conference, ALT 2003, Sapporo, Japan, October 17-19, 2003, Proceedings
Springer 2003 |
36 | EE | Ricard Gavaldà,
Denis Thérien:
Algebraic Characterizations of Small Classes of Boolean Functions.
STACS 2003: 331-342 |
2002 |
35 | | Carlos Domingo,
Ricard Gavaldà,
Osamu Watanabe:
Adaptive Sampling Methods for Scaling Up Knowledge Discovery Algorithms.
Data Min. Knowl. Discov. 6(2): 131-152 (2002) |
2001 |
34 | EE | Ricard Gavaldà,
Osamu Watanabe:
Sequential Sampling Algorithms: Unified Analysis and Lower Bounds.
SAGA 2001: 173-188 |
33 | EE | Ricard Gavaldà,
Denis Thérien:
Learning Expressions over Monoids.
STACS 2001: 283-293 |
32 | EE | Albert Atserias,
Nicola Galesi,
Ricard Gavaldà:
Monotone Proofs of the Pigeon Hole Principle.
Math. Log. Q. 47(4): 461-474 (2001) |
2000 |
31 | EE | Albert Atserias,
Nicola Galesi,
Ricard Gavaldà:
Monotone Proofs of the Pigeon Hole Principle.
ICALP 2000: 151-162 |
30 | EE | Albert Atserias,
Nicola Galesi,
Ricard Gavaldà:
Monotone Proofs of the Pigeon Hole Principle
Electronic Colloquium on Computational Complexity (ECCC) 7(8): (2000) |
1999 |
29 | EE | Carlos Domingo,
Ricard Gavaldà,
Osamu Watanabe:
Adaptive Sampling Methods for Scaling Up Knowledge Discovery Algorithms.
Discovery Science 1999: 172-183 |
28 | EE | Maria Luisa Bonet,
Carlos Domingo,
Ricard Gavaldà,
Alexis Maciel,
Toniann Pitassi:
Non-Automatizability of Bounded-Depth Frege Proofs.
IEEE Conference on Computational Complexity 1999: 15-23 |
27 | | Ricard Gavaldà,
Hava T. Siegelmann:
Discontinuities in Recurrent Neural Networks.
Neural Computation 11(3): 715-745 (1999) |
26 | EE | Ricardo A. Baeza-Yates,
Ricard Gavaldà,
Gonzalo Navarro,
R. Scheihing:
Bounding the Expected Length of Longest Common Subsequences and Forests.
Theory Comput. Syst. 32(4): 435-452 (1999) |
1998 |
25 | EE | Carlos Domingo,
Ricard Gavaldà,
Osamu Watanabe:
Practical Algorithms for On-line Sampling.
Discovery Science 1998: 150-161 |
24 | EE | Carlos Domingo,
Ricard Gavaldà,
Osamu Watanabe:
Practical algorithms for on-line sampling
CoRR cs.LG/9809122: (1998) |
1997 |
23 | | José L. Balcázar,
Josep Díaz,
Ricard Gavaldà:
Algorithms for Learning Finite Automata from Queries: A Unified View.
Advances in Algorithms, Languages, and Complexity 1997: 53-72 |
22 | | José L. Balcázar,
Ricard Gavaldà,
Osamu Watanabe:
Coding Complexity: The Computational Complexity of Succinct Descriptions.
Advances in Algorithms, Languages, and Complexity 1997: 73-91 |
21 | | José L. Balcázar,
Ricard Gavaldà,
Hava T. Siegelmann:
Computational power of neural networks: a characterization in terms of Kolmogorov complexity.
IEEE Transactions on Information Theory 43(4): 1175-1183 (1997) |
1996 |
20 | | Nader H. Bshouty,
Richard Cleve,
Ricard Gavaldà,
Sampath Kannan,
Christino Tamon:
Oracles and Queries That Are Sufficient for Exact Learning.
J. Comput. Syst. Sci. 52(3): 421-433 (1996) |
19 | | José L. Balcázar,
Josep Díaz,
Ricard Gavaldà,
Osamu Watanabe:
An Optimal Parallel Algorithm for Learning DFA.
J. UCS 2(3): 97-112 (1996) |
1995 |
18 | | Ricard Gavaldà,
David Guijarro:
Learning Ordered Binary Decision Diagrams.
ALT 1995: 228-238 |
17 | EE | Nader H. Bshouty,
Richard Cleve,
Ricard Gavaldà,
Sampath Kannan,
Christino Tamon:
Oracles and Queries That Are Sufficient for Exact Learning
Electronic Colloquium on Computational Complexity (ECCC) 2(15): (1995) |
16 | | Ricard Gavaldà:
Bounding the Complexity of Advice Functions.
J. Comput. Syst. Sci. 50(3): 468-475 (1995) |
1994 |
15 | EE | José L. Balcázar,
Josep Díaz,
Ricard Gavaldà,
Osamu Watanabe:
An Optimal Parallel Algorithm for Learning DFA.
COLT 1994: 208-217 |
14 | | Ricard Gavaldà:
The Complexity of Learning with Queries.
Structure in Complexity Theory Conference 1994: 324-337 |
13 | | Joaquim Gabarró,
Ricard Gavaldà:
An Approach to Correctness of Data Parallel Algorithms.
J. Parallel Distrib. Comput. 22(2): 185-201 (1994) |
12 | | Osamu Watanabe,
Ricard Gavaldà:
Structural Analysis of Polynomial-Time Query Learnability.
Mathematical Systems Theory 27(3): 231-256 (1994) |
11 | | José L. Balcázar,
Josep Díaz,
Ricard Gavaldà,
Osamu Watanabe:
The Query Complexity of Learning DFA.
New Generation Comput. 12(4): 337-358 (1994) |
1993 |
10 | | José L. Balcázar,
Ricard Gavaldà,
Hava T. Siegelmann,
Eduardo D. Sontag:
Some Structural Complexity Aspects of Neural Computation.
Structure in Complexity Theory Conference 1993: 253-265 |
9 | | Ricard Gavaldà:
A Positive Relativization of Polynomial Time Versus Polylog Space.
Inf. Process. Lett. 46(3): 119-123 (1993) |
8 | | Ricard Gavaldà,
Osamu Watanabe:
On the Computational Complexity of Small Descriptions.
SIAM J. Comput. 22(6): 1257-1275 (1993) |
1992 |
7 | | José L. Balcázar,
Josep Díaz,
Ricard Gavaldà,
Osamu Watanabe:
A Note on the Query Complexity of Learning DFA (Extended Abstract).
ALT 1992: 53-62 |
6 | | Joaquim Gabarró,
Ricard Gavaldà:
Correctness of flat data parallel algorithms: an axiomatic approach and examples.
PARLE 1992: 955-956 |
5 | | Ricard Gavaldà:
Bounding the Complexity of Advice Functions.
Structure in Complexity Theory Conference 1992: 249-254 |
1991 |
4 | | Ricard Gavaldà,
Osamu Watanabe:
On the Computational Complexity of Small Descriptions.
Structure in Complexity Theory Conference 1991: 89-101 |
3 | | Ricard Gavaldà,
José L. Balcázar:
Strong and Robustly Strong Polynomial-Time Reducibilities to Sparse Sets.
Theor. Comput. Sci. 88(1): 1-14 (1991) |
1990 |
2 | | Ricard Gavaldà,
Leen Torenvliet,
Osamu Watanabe,
José L. Balcázar:
Generalized Kolmogorov Complexity in Relativized Separations (Extended Abstract).
MFCS 1990: 269-276 |
1988 |
1 | | Ricard Gavaldà,
José L. Balcázar:
Strong and Robustly Strong Polynomial Time Reducibilities to Sparse Sets.
MFCS 1988: 300-308 |