Sciweavers

1951 search results - page 172 / 391
» An algorithm for improving graph partitions
Sort
View
DCC
1999
IEEE
15 years 9 months ago
Quadtree Classification and TCQ Image Coding
The set partitioning in hierarchical trees (SPIHT) wavelet image coding algorithm can be interpreted as implicitly using classification in its bit-plane coding procedure. The sourc...
Brian A. Banister, Thomas R. Fischer
FPGA
1998
ACM
142views FPGA» more  FPGA 1998»
15 years 9 months ago
A Hybrid Complete-Graph Partial-Crossbar Routing Architecture for Multi-FPGA Systems
Multi-FPGA systems (MFSs) are used as custom computing machines, logic emulators and rapid prototyping vehicles. A key aspect of these systems is their programmable routing archit...
Mohammed A. S. Khalid, Jonathan Rose
ICDE
2008
IEEE
336views Database» more  ICDE 2008»
16 years 6 months ago
Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
Lei Zou, Lei Chen 0002
ACIVS
2006
Springer
15 years 11 months ago
Improvement of Conventional Deinterlacing Methods with Extrema Detection and Interpolation
Abstract. This article presents a new algorithm for spatial deinterlacing that could easily be integrated in a more complete deinterlacing system, typically a spatio-temporal motio...
Jérôme Roussel, Pascal Bertolino, Mar...
148
Voted
APPROX
1998
Springer
150views Algorithms» more  APPROX 1998»
15 years 9 months ago
Approximating Circular Arc Colouring and Bandwidth Allocation in All-Optical Ring Networks
We present randomized approximation algorithms for the circular arc graph colouring problem and for the problem of bandwidth allocation in all-optical ring networks. We obtain a fa...
Vijay Kumar