1629 search results - page 75 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
EAAI
2006
14 years 10 months ago
2006
The problem of partitioning appears in several areas ranging from VLSI, parallel programming, to molecular biology. The interest in finding an optimal partition especially in VLSI ...
174
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
CORR
2002
Springer
14 years 9 months ago
2002
Springer
-- This paper introduces a novel method for synthesizing digital circuits derived from Binary Decision Diagrams (BDDs) that can yield to reduction in power dissipation. The power r...
SNPD
2008
14 years 11 months ago
2008
As processing power becomes cheaper and more available in cluster of computers, the need for parallel algorithm that can harness this computing potentials will increase. One applic...
DAM
2008
14 years 10 months ago
2008
We describe a graph coloring problem associated with the determination of mathematical derivatives. The coloring instances are obtained as intersection graphs of row partitioned s...