142 search results - page 9 / 29 » Generalizing Graphs Using Amalgamation and Selection |
101
click to vote
CC
2006
Springer
15 years 3 months ago
2006
Springer
We introduce a new class of compiler heuristics: hybrid optimizations. Hybrid optimizations choose dynamically at compile time which optimization algorithm to apply from a set of d...
101
click to vote
CIKM
2009
Springer
15 years 6 months ago
2009
Springer
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...
107
Voted
EMSOFT
2010
Springer
14 years 9 months ago
2010
Springer
We propose the first polynomial-time code selection algorithm for minimising the worst-case execution time of a nonnested loop executed on a fully pipelined processor that uses sc...
119
click to vote
JGAA
2007
14 years 11 months ago
2007
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
92
Voted
LCTRTS
2010
Springer
15 years 6 months ago
2010
Springer
A large number of embedded systems include 8-bit microcontrollers for their energy efficiency and low cost. Multi-bank memory architecture is commonly applied in 8-bit microcontr...