Sciweavers

2553 search results - page 201 / 511
» Modeling Trees with Hypertextures
Sort
View
ESA
2003
Springer
93views Algorithms» more  ESA 2003»
15 years 9 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...
132
Voted
IADIS
2003
15 years 5 months ago
Generating Guided Tours over Indexed Information Resources
This article proposes an approach to the generation of guided tours over indexed information resources on user demand. It represents an alternative to more sophisticated hyperdocu...
Benjamin Buffereau, Pierre Duchet, Philippe Picoue...
DASFAA
2005
IEEE
141views Database» more  DASFAA 2005»
15 years 9 months ago
Learning Tree Augmented Naive Bayes for Ranking
Naive Bayes has been widely used in data mining as a simple and effective classification algorithm. Since its conditional independence assumption is rarely true, numerous algorit...
Liangxiao Jiang, Harry Zhang, Zhihua Cai, Jiang Su
ICCAD
1994
IEEE
117views Hardware» more  ICCAD 1994»
15 years 8 months ago
Optimal latch mapping and retiming within a tree
We propose a technology mapping algorithm that takes existing structural technology-mapping algorithms based on dynamic programming [1,3,4] and extends them to retime pipelined cir...
Joel Grodstein, Eric Lehman, Heather Harkness, Her...
152
Voted
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
15 years 9 months ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud