Sciweavers

29 search results - page 4 / 6
» Smoothed Analysis of Binary Search Trees
Sort
View
PR
2010
135views more  PR 2010»
12 years 11 months ago
Revisiting priority queues for image analysis
Many algorithms in image analysis require a priority queue, a data structure that holds pointers to pixels in the image, and which allows efficiently finding the pixel in the queu...
Cris L. Luengo Hendriks
VRST
2009
ACM
13 years 11 months ago
Indexing and retrieval of human motion data by a hierarchical tree
For the convenient reuse of large-scale 3D motion capture data, browsing and searching methods for the data should be explored. In this paper, an efficient indexing and retrieval...
Shuangyuan Wu, Zhaoqi Wang, Shihong Xia
BMCBI
2010
164views more  BMCBI 2010»
13 years 5 months ago
Pan-genome sequence analysis using Panseq: an online tool for the rapid analysis of core and accessory genomic regions
Background: The pan-genome of a bacterial species consists of a core and an accessory gene pool. The accessory genome is thought to be an important source of genetic variability i...
Chad Laing, Cody Buchanan, Eduardo N. Taboada, Yon...
FSTTCS
2010
Springer
13 years 2 months ago
Average Analysis of Glushkov Automata under a BST-Like Model
We study the average number of transitions in Glushkov automata built from random regular expressions. This statistic highly depends on the probabilistic distribution set on the e...
Cyril Nicaud, Carine Pivoteau, Benoît Razet
INFOCOM
2000
IEEE
13 years 9 months ago
Near Optimal Routing Lookups with Bounded Worst Case Performance
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
Pankaj Gupta, Balaji Prabhakar, Stephen P. Boyd