Sciweavers

910 search results - page 84 / 182
» Detecting False Matches in String Matching Algorithms
Sort
View
DCC
2007
IEEE
16 years 2 months ago
Structure induction by lossless graph compression
This work is motivated by the necessity to automate the discovery of structure in vast and evergrowing collection of relational data commonly represented as graphs, for example ge...
Leonid Peshkin
CSR
2009
Springer
15 years 9 months ago
Variations on Muchnik's Conditional Complexity Theorem
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length ...
Daniil Musatov, Andrei E. Romashchenko, Alexander ...
CVPR
2007
IEEE
16 years 5 months ago
Learning Local Image Descriptors
In this paper we study interest point descriptors for image matching and 3D reconstruction. We examine the building blocks of descriptor algorithms and evaluate numerous combinati...
Simon A. J. Winder, Matthew Brown
DEBS
2007
ACM
15 years 7 months ago
Prefix forwarding for publish/subscribe
We present a prefix forwarding algorithm for content-based publish/subscribe systems. Our algorithm performs only one content-based match per message regardless of the number of r...
Zbigniew Jerzak, Christof Fetzer
GECCO
2010
Springer
155views Optimization» more  GECCO 2010»
15 years 8 months ago
Negative selection algorithms without generating detectors
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
Maciej Liskiewicz, Johannes Textor