6142 search results - page 490 / 1229 » The Complexity of Partition Functions |
192
click to vote
DAWAK
2000
Springer
15 years 11 months ago
2000
Springer
In the context of multidimensional databases implemented on relational DBMSs through star schemes, the most effective technique to enhance performances consists of materializing re...
186
click to vote
ISPD
1999
ACM
15 years 11 months ago
1999
ACM
For the development and evaluation of CAD-tools for partitioning, floorplanning, placement, and routing of digital circuits, a huge amount of benchmark circuits with suitable cha...
192
click to vote
GD
1999
Springer
15 years 11 months ago
1999
Springer
The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. The graph is partitioned into a subgraph, its copy, and a remaind...
172
click to vote
ASYNC
1998
IEEE
15 years 11 months ago
1998
IEEE
None of the available minimizers for exact 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to heuristic...
205
click to vote
SCALESPACE
1999
Springer
15 years 11 months ago
1999
Springer
In this paper, we propose a new model for active contours to detect objects in a given image, based on techniques of curve evolution, Mumford-Shah functional for segmentation and l...