2555 search results - page 169 / 511 » Quantifiers and Working Memory |
126
Voted
GROUP
2007
ACM
15 years 7 months ago
2007
ACM
We describe the design and evaluation of K-net, a social matching system to help people learn 'who knows what' in an organization by matching people with skills with tho...
119
Voted
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
140
click to vote
DAGSTUHL
1990
15 years 4 months ago
1990
One of the principal advantages of parallelizing a rule-based system, or more generally, any A.I. system, is the ability to pursue alternate search paths concurrently. Conventiona...
127
click to vote
EUROPAR
2010
Springer
15 years 4 months ago
2010
Springer
This work presents an application case study. Geant4 is a 750,000 line toolkit first designed in the mid-1990s and originally intended only for sequential computation. Intel's...
110
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Algorithms are developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place ...