15 search results - page 2 / 3 » World-Set Decompositions: Expressiveness and Efficient Algor... |
VLDB
1989
ACM
13 years 8 months ago
1989
ACM
This paper presents a parallel algorithm for recursive query processing and shows how it can be efficiently implemented in a local computer network. The algorithm relies on an int...
ICCAD
2007
IEEE
2007
IEEE
Finding linear building-blocks for RTL synthesis of polynomial datapaths with fixed-size bit-vectors
13 years 8 months ago
Abstract: Polynomial computations over fixed-size bitvectors are found in many practical datapath designs. For efficient RTL synthesis, it is important to identify good decompositi...
ICCV
2009
IEEE
14 years 9 months ago
2009
IEEE
Many interactive image segmentation approaches use an objective function which includes appearance models as an unknown variable. Since the resulting optimization problem is NP-har...
ICIP
2007
IEEE
14 years 6 months ago
2007
IEEE
We propose an adaptive multiresolution (MR) approach to the classification of fingerprint images. The system adds MR decomposition in front of a generic classifier consisting of f...
ICALP
1993
Springer
13 years 8 months ago
1993
Springer
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...