Sciweavers

2127 search results - page 21 / 426
» Computing large matchings fast
Sort
View
ICASSP
2007
IEEE
15 years 4 months ago
Fast Search of Sequences with Complex Symbol Correlations using Profile Context-Sensitive HMMS and Pre-Screening Filters
Recently, profile context-sensitive HMMs (profile-csHMMs) have been proposed which are very effective in modeling the common patterns and motifs in related symbol sequences. Pro...
Byung-Jun Yoon, P. P. Vaidyanathan
ICCAD
2008
IEEE
150views Hardware» more  ICCAD 2008»
15 years 6 months ago
Performance estimation and slack matching for pipelined asynchronous architectures with choice
— This paper presents a fast analytical method for estimating the throughput of pipelined asynchronous systems, and then applies that method to develop a fast solution to the pro...
Gennette Gill, Vishal Gupta, Montek Singh
PVLDB
2010
110views more  PVLDB 2010»
14 years 8 months ago
Behavior Based Record Linkage
In this paper, we present a new record linkage approach that uses entity behavior to decide if potentially different entities are in fact the same. An entity’s behavior is extra...
Mohamed Yakout, Ahmed K. Elmagarmid, Hazem Elmelee...
ICCV
2007
IEEE
15 years 4 months ago
Fast Matching of Planar Shapes in Sub-cubic Runtime
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
Frank R. Schmidt, Dirk Farin, Daniel Cremers
ICMCS
2006
IEEE
140views Multimedia» more  ICMCS 2006»
15 years 3 months ago
A Fast Matching Pursuits Algorithm using Sub-Band Decomposition of Video Signals
A high-efficiency video coding method using matching pursuits, which is a waveform coding technique, has recently been proposed. In this method, the motion compensated prediction...
Kousuke Imamura, Yoshimasa Koba, Hideo Hashimoto