488 search results - page 46 / 98 » Automorphic Decompositions of Graphs |
139
click to vote
ICIP
2007
IEEE
15 years 9 months ago
2007
IEEE
The use of an alphabet of line segments to compose a curve is a possible approach for curve data compression. An existing state-of-the-art method considers a quadtree decompositio...
126
click to vote
CP
2005
Springer
15 years 8 months ago
2005
Springer
This paper describes an efficient, complete approach for solving a complex allocation and scheduling problem for Multi-Processor System-on-Chip (MPSoC). Given a throughput constra...
126
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
117
Voted
DATE
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract - This paper describes an efficient graphbased method to optimize data-flow expressions for best hardware implementation. The method is based on factorization, common su...
109
click to vote
AIPS
2008
15 years 5 months ago
2008
We consider a generalization of the PDB homomorphism abstractions to what is called "structural patterns". The bais in abstracting the problem in hand into provably trac...