7504 search results - page 1233 / 1501 » Computing with Action Potentials |
141
click to vote
COMPGEOM
1993
ACM
15 years 8 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
161
click to vote
LCPC
1994
Springer
15 years 8 months ago
1994
Springer
Data parallel programs are sensitive to the distribution of data across processor nodes. We formulate the reduction of inter-node communication as an optimization on a colored gra...
129
click to vote
VLDB
1994
ACM
15 years 8 months ago
1994
ACM
In existing relational database systems, processing of group-by and computation of aggregate functions are always postponed until all joins are performed. In this paper, we presen...
124
click to vote
VLDB
1994
ACM
15 years 8 months ago
1994
ACM
The performance of data-parallel algorithms for spatial operations using data-parallel variants of the bucket PMR quadtree, R-tree, and R+-tree spatial data structures is compared...
155
click to vote
ACAL
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We explore a new definition of creativity -- one which emphasizes the statistical capacity of a system to generate previously unseen patterns -- and discuss motivations f...