Sciweavers

2479 search results - page 263 / 496
» A Computational Theory of Working Memory
Sort
View
ICALP
2010
Springer
15 years 8 months ago
Resource Oblivious Sorting on Multicores
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
Richard Cole, Vijaya Ramachandran
COGSCI
2008
87views more  COGSCI 2008»
15 years 6 months ago
Processing Polarity: How the Ungrammatical Intrudes on the Grammatical
A central question in online human sentence comprehension is: how are linguistic relations established between different parts of a sentence? Previous work has shown that this dep...
Shravan Vasishth, Sven Brüssow, Richard L. Le...
ADC
2010
Springer
210views Database» more  ADC 2010»
15 years 1 months ago
Towards unifying advances in twig join algorithms
Twig joins are key building blocks in current XML indexing systems, and numerous algorithms and useful data structures have been introduced. We give a structured, qualitative anal...
Nils Grimsmo, Truls Amundsen Bjørklund
ICIP
2003
IEEE
16 years 8 months ago
Algorithms for stochastic approximations of curvature flows
Curvature flows have been extensively considered from a deterministic point of view. They have been shown to be useful for a number of applications including crystal growth, flame...
Gozde B. Unal, Delphine Nain, G. Ben-Arous, Nahum ...
FOSSACS
2009
Springer
16 years 1 months ago
Realizability of Concurrent Recursive Programs
Abstract. We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicati...
Benedikt Bollig, Manuela-Lidia Grindei, Peter Habe...