Sciweavers

868 search results - page 128 / 174
» A general compression algorithm that supports fast searching
Sort
View
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
JAIR
2008
171views more  JAIR 2008»
13 years 9 months ago
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models
Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Multi-Valued Decision Diagrams (MDD) with AND nodes, in order to capture function ...
Robert Mateescu, Rina Dechter, Radu Marinescu 0002
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
ICC
2007
IEEE
14 years 3 months ago
Scheduling Feed Retrieval
— The popularity of RSS and similar feed formats is growing fast. This paper gives an overview of the standards and implementations in this field, and analyzes whether they allo...
Ward van Wanrooij, Aiko Pras
VRST
2004
ACM
14 years 2 months ago
Occlusion handling for medical augmented reality using a volumetric phantom model
The support of surgical interventions has long been in the focus of application-oriented augmented reality research. Modern methods of surgery, like minimally-invasive procedures,...
Jan Fischer, Dirk Bartz, Wolfgang Straßer