Sciweavers

2208 search results - page 131 / 442
» Memory Practices in the Sciences
Sort
View
ACSC
2003
IEEE
15 years 1 months ago
Efficient Trie-Based Sorting of Large Sets of Strings
Sorting is a fundamental algorithmic task. Many generalpurpose sorting algorithms have been developed, but efficiency gains can be achieved by designing algorithms for specific ki...
Ranjan Sinha, Justin Zobel
FOCS
1991
IEEE
15 years 1 months ago
A parallel algorithmic version of the Local Lemma
The Lov´asz Local Lemma is a tool that enables one to show that certain events hold with positive, though very small probability. It often yields existence proofs of results with...
Noga Alon
ACMSE
2008
ACM
15 years 23 hour ago
Mining frequent sequential patterns with first-occurrence forests
In this paper, a new pattern-growth algorithm is presented to mine frequent sequential patterns using First-Occurrence Forests (FOF). This algorithm uses a simple list of pointers...
Erich Allen Peterson, Peiyi Tang
GG
2010
Springer
14 years 10 months ago
A False History of True Concurrency: From Petri to Tools
I briefly review the history of the unfolding approach to model checking. Carl Adam Petri passed away on July 2, 2010. I learnt about his death three days later, a few hours after ...
Javier Esparza
SIGMOD
2008
ACM
98views Database» more  SIGMOD 2008»
14 years 9 months ago
Scaleability and immortality
James Nicholas Gray's understanding and experimentation gave him a special perspective. From 1995 his commitment was building indefinitely scalable tools by working on really...
Gordon Bell