Sciweavers

4983 search results - page 928 / 997
» order 2008
Sort
View
IANDC
2008
141views more  IANDC 2008»
13 years 8 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...
TALG
2008
131views more  TALG 2008»
13 years 8 months ago
Kinetic and dynamic data structures for closest pair and all nearest neighbors
We present simple, fully dynamic and kinetic data structures, which are variants of a dynamic two-dimensional range tree, for maintaining the closest pair and all nearest neighbors...
Pankaj K. Agarwal, Haim Kaplan, Micha Sharir
DM
1998
195views more  DM 1998»
13 years 8 months ago
On basis-exchange properties for matroids
We give a counterexample to a conjecture by Wild about binary matroids. We connect two equivalent lines of research in matroid theory: a simple type of basis-exchange property and ...
Joseph E. Bonin
CVPR
2008
IEEE
14 years 10 months ago
A region based stereo matching algorithm using cooperative optimization
This paper presents a new stereo matching algorithm based on inter-regional cooperative optimization. The proposed algorithm uses regions as matching primitives and defines the co...
Zeng-Fu Wang, Zhi-Gang Zheng
CVPR
2008
IEEE
14 years 10 months ago
Generalised blurring mean-shift algorithms for nonparametric clustering
Gaussian blurring mean-shift (GBMS) is a nonparametric clustering algorithm, having a single bandwidth parameter that controls the number of clusters. The algorithm iteratively sh...
Miguel Á. Carreira-Perpiñán