Sciweavers

495 search results - page 44 / 99
» Probability Trees
Sort
View
ICDM
2009
IEEE
112views Data Mining» more  ICDM 2009»
14 years 3 months ago
Spatio-temporal Multi-dimensional Relational Framework Trees
—The real world is composed of sets of objects that move and morph in both space and time. Useful concepts can be defined in terms of the complex interactions between the multi-...
Matthew Bodenhamer, Samuel Bleckley, Daniel Fennel...
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
14 years 21 days ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
FOSSACS
2004
Springer
14 years 2 months ago
Duality for Labelled Markov Processes
Labelled Markov processes (LMPs) are automata whose transitions are given by probability distributions. In this paper we present a ‘universal’ LMP as the spectrum of a commutat...
Michael W. Mislove, Joël Ouaknine, Dusko Pavl...
ESA
2003
Springer
93views Algorithms» more  ESA 2003»
14 years 1 months ago
Improved Bounds for Finger Search on a RAM
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
Alexis C. Kaporis, Christos Makris, Spyros Sioutas...
EDBT
2011
ACM
205views Database» more  EDBT 2011»
13 years 5 days ago
A probabilistic XML merging tool
This demonstration paper presents a probabilistic XML data merging tool, that represents the outcome of semi-structured document integration as a probabilistic tree. The system is...
Talel Abdessalem, M. Lamine Ba, Pierre Senellart