2555 search results - page 192 / 511 » Quantifiers and Working Memory |
141
click to vote
KDD
1998
ACM
15 years 8 months ago
1998
ACM
Practical clustering algorithms require multiple data scans to achieve convergence. For large databases, these scans become prohibitively expensive. We present a scalable clusteri...
133
click to vote
DDECS
2009
IEEE
15 years 7 months ago
2009
IEEE
Although the Neighborhood Pattern Sensitive Fault (NPSF) model is recognized as a high quality fault model for memory arrays, the excessive test application time cost associated wi...
145
click to vote
CCS
2006
ACM
15 years 7 months ago
2006
ACM
Key establishment is a fundamental prerequisite for secure communication in wireless sensor networks. A new node joining the network needs to efficiently and autonomously set up s...
156
click to vote
ICCS
2007
Springer
15 years 5 months ago
2007
Springer
This invited contribution motivates the Hypermedia Discourse research programme, investigating the reading, writing and contesting of ideas as hypermedia networks grounded in disco...
ACL
1998
15 years 5 months ago
1998
In this study, a learning device based on the PATtree data structures was developed. The original PAT-trees were enhanced with the deletion function to emulate human learning comp...