Sciweavers

24 search results - page 3 / 5
» Distances in random digital search trees
Sort
View
ICRA
2010
IEEE
179views Robotics» more  ICRA 2010»
13 years 5 months ago
Needle path planning for digital breast tomosynthesis biopsy
This paper presents a new needle path planning method for digital breast tomosynthesis biopsy. Needle insertion planning into deformable tissue for breast biopsy procedure is a cha...
Laurence Vancamberg, Anis Sahbani, Serge Muller, G...
ICIP
2010
IEEE
13 years 5 months ago
Building Emerging Pattern (EP) Random forest for recognition
The Random forest classifier comes to be the working horse for visual recognition community. It predicts the class label of an input data by aggregating the votes of multiple tree...
Liang Wang, Yizhou Wang, Debin Zhao
COMPGEOM
2010
ACM
14 years 17 days ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
FSTTCS
2010
Springer
13 years 5 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
ADC
2007
Springer
183views Database» more  ADC 2007»
13 years 11 months ago
Efficient Similarity Search by Summarization in Large Video Database
With the explosion of video data, video processing technologies have advanced quickly and been applied into many fields, such as advertisements, medical etc.. To fast search these...
Xiangmin Zhou, Xiaofang Zhou, Heng Tao Shen