Sciweavers

73 search results - page 11 / 15
» Kernels of Directed Graph Laplacians
Sort
View
SAMOS
2004
Springer
14 years 1 days ago
A Novel Data-Path for Accelerating DSP Kernels
A high-performance data-path to implement DSP kernels is proposed in this paper. The data-path is based on a flexible, universal, and regular component to optimally exploiting both...
Michalis D. Galanis, George Theodoridis, Spyros Tr...
CIVR
2007
Springer
178views Image Analysis» more  CIVR 2007»
14 years 26 days ago
Layout indexing of trademark images
Ensuring the uniqueness of trademark images and protecting their identities are the most important objectives for the trademark registration process. To prevent trademark infringe...
Reinier H. van Leuken, M. Fatih Demirci, Victoria ...
CPM
1994
Springer
123views Combinatorics» more  CPM 1994»
13 years 10 months ago
Computing all Suboptimal Alignments in Linear Space
Recently, a new compact representation for suboptimal alignments was proposed by Naor and Brutlag (1993). The kernel of that representation is a minimal directed acyclic graph (DAG...
Kun-Mao Chao
SODA
2012
ACM
243views Algorithms» more  SODA 2012»
11 years 9 months ago
Bidimensionality and geometric graphs
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
IJCAI
2007
13 years 8 months ago
A Factor Graph Model for Software Bug Finding
Automatic tools for finding software errors require knowledge of the rules a program must obey, or “specifications,” before they can identify bugs. We present a method that ...
Ted Kremenek, Andrew Y. Ng, Dawson R. Engler