Sciweavers

10 search results - page 1 / 2
» S(b)-Trees: An Optimal Balancing of Variable Length Keys
Sort
View
MSV
2004
13 years 6 months ago
S(b)-Trees: An Optimal Balancing of Variable Length Keys
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...
Konstantin V. Shvachko
ISCAS
2002
IEEE
124views Hardware» more  ISCAS 2002»
13 years 9 months ago
Performance optimization of multiple memory architectures for DSP
Multiple memory module architecture offers higher performance by providing potentially doubled memory bandwidth. Two key problems in gaining high performance in this kind of archi...
Qingfeng Zhuge, Bin Xiao, Edwin Hsing-Mean Sha
ECCV
2010
Springer
13 years 10 months ago
3D Point Correspondence by Minimum Description Length in Feature Space
Abstract. Finding point correspondences plays an important role in automatically building statistical shape models from a training set of 3D surfaces. For the point correspondence ...
GLOBECOM
2009
IEEE
13 years 11 months ago
Multihop MIMO Relay Networks with ARQ
—A multiple antenna multihop relay network consisting of a source, a relay, and a destination node, is considered. The diversity-multiplexing-delay tradeoffs (DMDT) for various m...
Yao Xie, Deniz Gündüz, Andrea J. Goldsmi...
SIAMDM
2008
143views more  SIAMDM 2008»
13 years 4 months ago
Coloring Bull-Free Perfectly Contractile Graphs
We consider the class of graphs that contain no bull, no odd hole, and no antihole of length at least five. We present a new algorithm that colors optimally the vertices of every g...
Benjamin Lévêque, Frédé...