455 search results - page 53 / 91 » On Trees and Noncrossing Partitions |
GRC
2009
IEEE
13 years 11 months ago
2009
IEEE
This paper proposes a code granulation space which can be applied to program construction and processing. Each granule in the space is defined as an improvement to the seed progra...
SBBD
2007
13 years 9 months ago
2007
The main contribution of this paper is a bulk-loading algorithm for multi-way dynamic metric access methods based on the covering radius of a representative, like the Slim-tree. Th...
SBBD
2007
13 years 9 months ago
2007
Similarity joins in databases can be used for several important tasks such as data cleaning and instance-based data integration. In this paper, we explore ways how to support such ...
SIGPRO
2002
13 years 7 months ago
2002
The three-dimensional (3-D) SPIHT coder is a scalable or embedded coder that has proved its efficiency and its real-time capability in compression of video. A forward-error-correc...
ISPDC
2010
IEEE
13 years 5 months ago
2010
IEEE
We propose a two layer protocol for tracking fast targets in sensor networks. At the lower layer, the Distributed Spanning Tree Algorithm (DSTA) [12] partitions the network into c...