Sciweavers

911 search results - page 44 / 183
» Kolmogorov Complexity Cores
Sort
View
IANDC
2010
79views more  IANDC 2010»
15 years 4 months ago
Complexity of deciding bisimilarity between normed BPA and normed BPP
We present a polynomial-time algorithm deciding bisimilarity between a normed BPA process and a normed BPP process, with running time O(n7 ). This improves the previously known ex...
Petr Jancar, Martin Kot, Zdenek Sawa
EUROSYS
2010
ACM
16 years 3 months ago
A Comprehensive Scheduler for Asymmetric Multicore Systems
Symmetric-ISA (instruction set architecture) asymmetricperformance multicore processors were shown to deliver higher performance per watt and area for codes with diverse architect...
Juan Carlos Saez, Manuel Prieto Matias, Alexandra ...
CASES
2007
ACM
15 years 10 months ago
Application driven embedded system design: a face recognition case study
The key to increasing performance without a commensurate increase in power consumption in modern processors lies in increasing both parallelism and core specialization. Core speci...
Karthik Ramani, Al Davis
FPL
2006
Springer
91views Hardware» more  FPL 2006»
15 years 9 months ago
Reconfigurable Systems Enabled by a Network-on-Chip
A modern SoC design comprises dozens of dedicated IP cores for specialized tasks and processors for generalpurpose tasks. Flexibility is the key feature of processors, since it is...
Leandro Möller, Ismael Grehs, Ney Calazans, F...
ECCV
2002
Springer
16 years 8 months ago
What Energy Functions Can Be Minimized via Graph Cuts?
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...
Vladimir Kolmogorov, Ramin Zabih