#### Filter Results:

- Full text PDF available (44)

#### Publication Year

1988

2016

- This year (0)
- Last 5 years (7)
- Last 10 years (25)

#### Publication Type

#### Co-author

#### Publication Venue

#### Brain Region

#### Key Phrases

#### Method

Learn More

- R De Jong, E Berendsen, R Cools
- Acta psychologica
- 1999

Interference effects on task performance in conflict situations might reflect real limitations in inhibitory capabilities or failures to fully or consistently utilize such capabilities in executive control of task performance. We propose that useful clues regarding the actual cause of interference effects may be obtained from examination of their robustness… (More)

- Ronald Cools, Richard B. Ivry, Mark D'Esposito
- J. Cognitive Neuroscience
- 2006

Various lines of evidence suggest that the striatum is implicated in cognitive flexibility. The neuropsychological evidence has, for the most part, been based on research with patients with Parkinson's disease, which is accompanied by chemical disruption of both the striatum and the prefrontal cortex. The present study examined this issue by testing… (More)

- Mathias De Wachter, Mike Matton, Kris Demuynck, Patrick Wambacq, Ronald Cools, Dirk Van Compernolle
- IEEE Transactions on Audio, Speech, and Language…
- 2007

Despite their known weaknesses, hidden Markov models (HMMs) have been the dominant technique for acoustic modeling in speech recognition for over two decades. Still, the advances in the HMM framework have not solved its key problems: it discards information about time dependencies and is prone to overgeneralization. In this paper, we attempt to overcome… (More)

- Dirk Nuyens, Ronald Cools
- Math. Comput.
- 2006

We reformulate the original component-by-component algorithm for rank-1 lattices in a matrix-vector notation so as to highlight its structural properties. For function spaces similar to a weighted Korobov space, we derive a technique which has construction cost O(sn log(n)), in contrast with the original algorithm which has construction cost O(sn 2). Herein… (More)

- J N Lyness, Ronald Cools
- 1994

This survey collects together theoretical results in the area of numerical cubature over triangles and is a vehicle for a current bibliography. We treat rst the theory relating to regular integrands and then the corresponding theory for singular integrands with emphasis on the \full corner singularity." Within these two sections we treat successively… (More)

- Dirk Nuyens, Ronald Cools
- J. Complexity
- 2006

The component-by-component construction algorithm constructs the generating vector for a rank-1 lattice one component at a time by minimizing the worst-case error in each step. This algorithm can be formulated elegantly as a repeated matrix-vector product, where the matrix-vector product expresses the calculation of the worst-case error in that step. As was… (More)

- Jan Verschelde, Ronald Cools
- Applicable Algebra in Engineering, Communication…
- 1993

The classical Theorem of Bézout yields an upper bound for the number of finite solutions to a given polynomial system, but is very often too large to be useful for the construction of a start system, for the solution of a polynomial system by means of homotopy continuation. The BKK bound gives a much lower upper bound for the number of solutions, but… (More)

- Ronald Cools, Luc Pluym, Dirk Laurie
- ACM Trans. Math. Softw.
- 1997

In this article, software for the numerical approximation ofdouble integrals over a variety of regions is described. Thesoftware was written in C++. Classes for a large number of shapesare provided. A global adaptive integration algorithm is used basedon transformations and subdivisions of regions.

Given a set of integer vectors defined by linear inequalities over a fixed number of variables, where some of the variables are considered as parameters, we consider two different ways of representing the number of elements in the set in terms of the parameters. The first is an explicit function which generalizes Ehrhart quasi-polynomials. The second is its… (More)

- Tim Pillards, Ronald Cools
- 2003

Sequences of points with a low discrepancy are the basic building blocks for quasi-Monte Carlo methods. Traditionally these points are generated in a unit cube. To develop point sets on a simplex we will transform the low-discrepancy points for the unit cube to a simplex. An advantage of this approach is that most of the known results on low discrepancy… (More)