Sciweavers

2479 search results - page 408 / 496
» A Computational Theory of Working Memory
Sort
View
AO
2005
147views more  AO 2005»
15 years 5 months ago
Domain modelling and NLP: Formal ontologies? Lexica? Or a bit of both?
There are a number of genuinely open questions concerning the use of domain models in nlp. It would be great if contributors to Applied Ontology could help addressing them rather ...
Massimo Poesio
PE
2010
Springer
102views Optimization» more  PE 2010»
15 years 4 months ago
Extracting state-based performance metrics using asynchronous iterative techniques
Solution of large sparse linear fixed-point problems lies at the heart of many important performance analysis calculations. These calculations include steady-state, transient and...
Douglas V. de Jager, Jeremy T. Bradley
PLDI
2003
ACM
15 years 11 months ago
Compile-time composition of run-time data and iteration reorderings
Many important applications, such as those using sparse data structures, have memory reference patterns that are unknown at compile-time. Prior work has developed runtime reorderi...
Michelle Mills Strout, Larry Carter, Jeanne Ferran...
CHARME
2001
Springer
133views Hardware» more  CHARME 2001»
15 years 10 months ago
View from the Fringe of the Fringe
Formal analysis remains outside the mainstream of system design practice. Interactive methods and tools are regarded by some to be on the margin of useful research in this area. Al...
Steven D. Johnson
SOUPS
2010
ACM
15 years 10 months ago
A closer look at recognition-based graphical passwords on mobile devices
Graphical password systems based on the recognition of photographs are candidates to alleviate current over-reliance on alphanumeric passwords and PINs. However, despite being bas...
Paul Dunphy, Andreas P. Heiner, N. Asokan