Sciweavers

3630 search results - page 235 / 726
» Fast Marching Methods
Sort
View
PKDD
2000
Springer
144views Data Mining» more  PKDD 2000»
15 years 10 months ago
Fast Hierarchical Clustering Based on Compressed Data and OPTICS
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
Markus M. Breunig, Hans-Peter Kriegel, Jörg S...
ECCV
2010
Springer
15 years 9 months ago
Recursive Coarse-to-Fine Localization for fast Object Detection
Cascading techniques are commonly used to speed-up the scan of an image for object detection. However, cascades of detectors are slow to train due to the high number of detectors a...
Marco Pedersoli, Jordi Gonzàlez, Andrew D. Bagdan...
DAGSTUHL
2007
15 years 8 months ago
How Fast can be Algebraic Attacks on Block Ciphers?
In this paper we give a specification of a new block cipher that can be called the Courtois Toy Cipher (CTC). It is quite simple, and yet very much like any other known block ciph...
Nicolas Courtois
BMCBI
2010
86views more  BMCBI 2010»
15 years 6 months ago
Fast motif recognition via application of statistical thresholds
Background: Improving the accuracy and efficiency of motif recognition is an important computational challenge that has application to detecting transcription factor binding sites...
Christina Boucher, James King
BMCBI
2007
151views more  BMCBI 2007»
15 years 6 months ago
Minimus: a fast, lightweight genome assembler
Background: Genome assemblers have grown very large and complex in response to the need for algorithms to handle the challenges of large whole-genome sequencing projects. Many of ...
Daniel D. Sommer, Arthur L. Delcher, Steven L. Sal...