Sciweavers

234 search results - page 30 / 47
» Randomized splay trees: Theoretical and experimental results
Sort
View
ISAAC
1999
Springer
110views Algorithms» more  ISAAC 1999»
15 years 10 months ago
Online Routing in Triangulations
We consider online routing algorithms for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing algorit...
Prosenjit Bose, Pat Morin
PAMI
2006
81views more  PAMI 2006»
15 years 6 months ago
Robust and Accurate Vectorization of Line Drawings
This paper presents a method for vectorizing the graphical parts of paper-based line drawings. The method consists of separating the input binary image into layers of homogeneous t...
Xavier Hilaire, Karl Tombre
DASFAA
2007
IEEE
221views Database» more  DASFAA 2007»
16 years 12 days ago
TwigList : Make Twig Pattern Matching Fast
Twig pattern matching problem has been widely studied in recent years. Give an XML tree T . A twig-pattern matching query, Q, represented as a query tree, is to find all the occur...
Lu Qin, Jeffrey Xu Yu, Bolin Ding
DSN
2007
IEEE
16 years 12 days ago
Emergent Structure in Unstructured Epidemic Multicast
In epidemic or gossip-based multicast protocols, each node simply relays each message to some random neighbors, such that all destinations receive it at least once with high proba...
Nuno Carvalho, José Pereira, Rui Carlos Oli...
SBACPAD
2007
IEEE
128views Hardware» more  SBACPAD 2007»
16 years 10 days ago
Node Level Primitives for Parallel Exact Inference
We present node level primitives for parallel exact inference on an arbitrary Bayesian network. We explore the probability representation on each node of Bayesian networks and eac...
Yinglong Xia, Viktor K. Prasanna