Sciweavers

2479 search results - page 129 / 496
» A Computational Theory of Working Memory
Sort
View
AAAI
2008
13 years 10 months ago
Grounding with Bounds
Grounding is the task of reducing a first-order theory to an equivalent propositional one. Typical grounders work on a sentence-by-sentence level, substituting variables by domain...
Johan Wittocx, Maarten Mariën, Marc Denecker
ACL
2010
13 years 5 months ago
Complexity Metrics in an Incremental Right-Corner Parser
Hierarchical HMM (HHMM) parsers make promising cognitive models: while they use a bounded model of working memory and pursue incremental hypotheses in parallel, they still achieve...
Stephen Wu, Asaf Bachrach, Carlos Cardenas, Willia...
KDD
2009
ACM
185views Data Mining» more  KDD 2009»
14 years 8 months ago
On compressing social networks
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, ...
DSN
2000
IEEE
14 years 8 days ago
Data Replication Strategies for Fault Tolerance and Availability on Commodity Clusters
Recent work has shown the advantages of using persistent memory for transaction processing. In particular, the Vista transaction system uses recoverable memory to avoid disk I/O, ...
Cristiana Amza, Alan L. Cox, Willy Zwaenepoel
SIGGRAPH
2000
ACM
14 years 6 days ago
Pomegranate: a fully scalable graphics architecture
Pomegranate is a parallel hardware architecture for polygon rendering that provides scalable input bandwidth, triangle rate, pixel rate, texture memory and display bandwidth while...
Matthew Eldridge, Homan Igehy, Pat Hanrahan