Sciweavers

4541 search results - page 470 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
ESA
2006
Springer
125views Algorithms» more  ESA 2006»
15 years 7 months ago
Purely Functional Worst Case Constant Time Catenable Sorted Lists
We present a purely functional implementation of search trees that requires O(log n) time for search and update operations and supports the join of two trees in worst case constant...
Gerth Stølting Brodal, Christos Makris, Kos...
SODA
1997
ACM
76views Algorithms» more  SODA 1997»
15 years 6 months ago
Markov Chains for Linear Extensions, the Two-Dimensional Case
We study the generation of uniformly distributed linear extensions using Markov chains. In particular we show that monotone coupling from the past can be applied in the case of lin...
Stefan Felsner, Lorenz Wernisch
BIODATAMINING
2008
120views more  BIODATAMINING 2008»
15 years 5 months ago
Filling the gap between biology and computer science
This editorial introduces BioData Mining, a new journal which publishes research articles related to advances in computational methods and techniques for the extraction of useful ...
Jesús S. Aguilar-Ruiz, Jason H. Moore, Mary...
TAMC
2009
Springer
15 years 11 months ago
The Extended Turing Model as Contextual Tool
Computability concerns information with a causal – typically algorithmic – structure. As such, it provides a schematic analysis of many naturally occurring situations. We look ...
S. Barry Cooper
IRI
2006
IEEE
15 years 11 months ago
Replacing full rectangles by dense rectangles: Concept lattices and attribute implications
— Maximal full rectangles in tabular data are useful in several areas of data engineering. This paper presents a survey of results in which we replace “full rectangles” by ...
Radim Belohlávek, Vilém Vychodil