Sciweavers

773 search results - page 74 / 155
» Suffix Trees on Words
Sort
View
ISPDC
2006
IEEE
15 years 6 months ago
How to Achieve High Throughput with Dynamic Tree-Structured Coterie
Data replication permits a better network bandwidth utilization and minimizes the effect of latency in large-scale systems such as computing grids. However, the cost of maintainin...
Ivan Frain, Abdelaziz Mzoughi, Jean Paul Bahsoun
INFOVIS
2003
IEEE
15 years 5 months ago
Visualization of Large-Scale Customer Satisfaction Surveys Using a Parallel Coordinate Tree
Satisfaction surveys are an important measurement tool in fields such as market research or human resources management. Serious studies consist of numerous questions and contain a...
Dominique Brodbeck, Luc Girardin
COCO
1991
Springer
112views Algorithms» more  COCO 1991»
15 years 3 months ago
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Rafi Heiman, Avi Wigderson
SODA
1998
ACM
98views Algorithms» more  SODA 1998»
15 years 1 months ago
Finger Search Trees with Constant Insertion Time
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at ...
Gerth Stølting Brodal
CORR
2010
Springer
69views Education» more  CORR 2010»
14 years 12 months ago
Epistemic irrelevance in credal nets: the case of imprecise Markov trees
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal ne...
Gert de Cooman, Filip Hermans, Alessandro Antonucc...