Sciweavers

785 search results - page 121 / 157
» Binary Join Trees
Sort
View
CCCG
2008
14 years 11 months ago
On the Complexity of Point Recolouring in Geometric Graphs
Given a collection of points representing geographic data we consider the task of delineating boundaries based on the features of the points. Assuming that the features are binary...
Henk Meijer, Yurai Núñez Rodrí...
PDPTA
2003
14 years 11 months ago
A Design for Node Coloring and 1-Fair Alternator on de Bruijn Networks
In this paper, we study the coloring problem for the undirected binary de Bruijn interconnection network. The coloring scheme is simple and fast. We propose the coloring algorithm...
Jyh-Wen Mao, Chang-Biau Yang
SODA
1997
ACM
199views Algorithms» more  SODA 1997»
14 years 11 months ago
Fast Algorithms for Sorting and Searching Strings
We present theoretical algorithms for sorting and searching multikey data, and derive from them practical C implementations for applications in which keys are character strings. T...
Jon Louis Bentley, Robert Sedgewick
JMLR
2006
90views more  JMLR 2006»
14 years 9 months ago
Superior Guarantees for Sequential Prediction and Lossless Compression via Alphabet Decomposition
We present worst case bounds for the learning rate of a known prediction method that is based on hierarchical applications of binary context tree weighting (CTW) predictors. A heu...
Ron Begleiter, Ran El-Yaniv
IVC
2002
142views more  IVC 2002»
14 years 9 months ago
Real-time tracking of complex structures with on-line camera calibration
This paper presents a novel three-dimensional model-based tracking system which has been incorporated into a visual servoing system. The tracking system combines modern graphical ...
Tom Drummond, Roberto Cipolla