Sciweavers

702 search results - page 28 / 141
» Identifying Graph Automorphisms Using Determining Sets
Sort
View
ISCA
2005
IEEE
134views Hardware» more  ISCA 2005»
14 years 2 months ago
An Architecture Framework for Transparent Instruction Set Customization in Embedded Processors
Instruction set customization is an effective way to improve processor performance. Critical portions of application dataflow graphs are collapsed for accelerated execution on s...
Nathan Clark, Jason A. Blome, Michael L. Chu, Scot...
CVPR
2008
IEEE
14 years 10 months ago
High resolution motion layer decomposition using dual-space graph cuts
We introduce a novel energy minimization method to decompose a video into a set of super-resolved moving layers. The proposed energy corresponds to the cost of coding the sequence...
Thomas Schoenemann, Daniel Cremers
CAV
2008
Springer
96views Hardware» more  CAV 2008»
13 years 10 months ago
Implied Set Closure and Its Application to Memory Consistency Verification
Hangal et. al. [3] have developed a procedure to check if an instance of the execution of a shared memory multiprocessor program, is consistent with the Total Store Order (TSO) mem...
Surender Baswana, Shashank K. Mehta, Vishal Powar
ISCI
2007
170views more  ISCI 2007»
13 years 8 months ago
Automatic learning of cost functions for graph edit distance
Graph matching and graph edit distance have become important tools in structural pattern recognition. The graph edit distance concept allows us to measure the structural similarit...
Michel Neuhaus, Horst Bunke
BMCBI
2010
121views more  BMCBI 2010»
13 years 6 months ago
A grammar-based distance metric enables fast and accurate clustering of large sets of 16S sequences
Background: We propose a sequence clustering algorithm and compare the partition quality and execution time of the proposed algorithm with those of a popular existing algorithm. T...
David J. Russell, Samuel F. Way, Andrew K. Benson,...