Sciweavers

66 search results - page 2 / 14
» Efficient Matrix Chain Ordering in Polylog Time
Sort
View
SISAP
2010
IEEE
243views Data Mining» more  SISAP 2010»
14 years 11 months ago
Similarity matrix compression for efficient signature quadratic form distance computation
Determining similarities among multimedia objects is a fundamental task in many content-based retrieval, analysis, mining, and exploration applications. Among state-of-the-art sim...
Christian Beecks, Merih Seran Uysal, Thomas Seidl
AIPS
2010
15 years 1 months ago
Forward-Chaining Partial-Order Planning
Over the last few years there has been a revival of interest in the idea of least-commitment planning with a number of researchers returning to the partial-order planning approach...
Amanda Jane Coles, Andrew Coles, Maria Fox, Derek ...
112
Voted
RECOMB
2010
Springer
14 years 11 months ago
Novel Definition and Algorithm for Chaining Fragments with Proportional Overlaps
Chaining fragments is a crucial step in genome alignment. Existing chaining algorithms compute a maximum weighted chain with no overlaps allowed between adjacent fragments. In prac...
Raluca Uricaru, Alban Mancheron, Eric Rivals
ACIVS
2006
Springer
15 years 7 months ago
Dedicated Hardware for Real-Time Computation of Second-Order Statistical Features for High Resolution Images
We present a novel dedicated hardware system for the extraction of second-order statistical features from high-resolution images. The selected features are based on gray level co-o...
Dimitris G. Bariamis, Dimitrios K. Iakovidis, Dimi...
DFT
2002
IEEE
128views VLSI» more  DFT 2002»
15 years 6 months ago
Matrix-Based Test Vector Decompression Using an Embedded Processor
This paper describes a new compression/decompression methodology for using an embedded processor to test the other components of a system-on-a-chip (SoC). The deterministic test v...
Kedarnath J. Balakrishnan, Nur A. Touba