Sciweavers

ICPR
2010
IEEE
15 years 8 months ago
Quasi-Dense Wide Baseline Matching for Three Views
This paper proposes a method for computing a quasi-dense set of matching points between three views of a scene. The method takes a sparse set of seed matches between pairs of view...
Pekka Koskenkorva, Juho Kannala, Sami Sebastian Br...
BIRTHDAY
2010
Springer
15 years 8 months ago
From Nondeterministic Suffix Automaton to Lazy Suffix Tree
Given two strings, a pattern P of length m and a text T of length n over some alphabet of size , we consider the exact string matching problem, i.e. we want to report all occurren...
Kimmo Fredriksson
BIRTHDAY
2010
Springer
15 years 8 months ago
Clustering the Normalized Compression Distance for Influenza Virus Data
The present paper analyzes the usefulness of the normalized compression distance for the problem to cluster the hemagglutinin (HA) sequences of influenza virus data for the HA gene...
Kimihito Ito, Thomas Zeugmann, Yu Zhu
ASPLOS
2010
ACM
15 years 8 months ago
Butterfly analysis: adapting dataflow analysis to dynamic parallel monitoring
Online program monitoring is an effective technique for detecting bugs and security attacks in running applications. Extending these tools to monitor parallel programs is challeng...
Michelle L. Goodstein, Evangelos Vlachos, Shimin C...
ASPLOS
2010
ACM
15 years 8 months ago
Fairness via source throttling: a configurable and high-performance fairness substrate for multi-core memory systems
Cores in a chip-multiprocessor (CMP) system share multiple hardware resources in the memory subsystem. If resource sharing is unfair, some applications can be delayed significantl...
Eiman Ebrahimi, Chang Joo Lee, Onur Mutlu, Yale N....