Sciweavers

666 search results - page 42 / 134
» When Similar Problems Don't Have Similar Solutions
Sort
View
SCIA
2009
Springer
305views Image Analysis» more  SCIA 2009»
14 years 3 months ago
A Convex Approach to Low Rank Matrix Approximation with Missing Data
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
Carl Olsson, Magnus Oskarsson
KDD
2004
ACM
182views Data Mining» more  KDD 2004»
14 years 9 months ago
Rotation invariant distance measures for trajectories
For the discovery of similar patterns in 1D time-series, it is very typical to perform a normalization of the data (for example a transformation so that the data follow a zero mea...
Michail Vlachos, Dimitrios Gunopulos, Gautam Das
SCAM
2007
IEEE
14 years 3 months ago
Fast Approximate Matching of Programs for Protecting Libre/Open Source Software by Using Spatial Indexes
To encourage open source/libre software development, it is desirable to have tools that can help to identify open source license violations. This paper describes the implementatio...
Arnoldo José Müller Molina, Takeshi Sh...
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
13 years 11 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
INTERACT
2003
13 years 10 months ago
How Blind Users' Mental Models Affect Their Perceived Usability of an Unfamiliar Screen Reader
: This study investigates blind users’ mental models of Windows environment and their strategies in coping with new desktops and applications. The relationship between users’ m...
Sri Hastuti Kurniawan, Alistair G. Sutcliffe, Paul...