Sciweavers

2127 search results - page 169 / 426
» Computing large matchings fast
Sort
View
CCS
2005
ACM
15 years 9 months ago
Fast dictionary attacks on passwords using time-space tradeoff
Human-memorable passwords are a mainstay of computer security. To decrease vulnerability of passwords to bruteforce dictionary attacks, many organizations enforce complicated pass...
Arvind Narayanan, Vitaly Shmatikov
BMCBI
2010
151views more  BMCBI 2010»
15 years 4 months ago
Misty Mountain clustering: application to fast unsupervised flow cytometry gating
Background: There are many important clustering questions in computational biology for which no satisfactory method exists. Automated clustering algorithms, when applied to large,...
István P. Sugár, Stuart C. Sealfon
DASIP
2010
14 years 11 months ago
FPGA-based rectification of stereo images
In order to obtain depth perception in computer vision, one needs to process pairs of stereo images. This process is computationally challenging to be carried out in real-time as i...
Joao G. P. Rodrigues, João Canas Ferreira
BMCBI
2006
143views more  BMCBI 2006»
15 years 4 months ago
Fast estimation of the difference between two PAM/JTT evolutionary distances in triplets of homologous sequences
Background: The estimation of the difference between two evolutionary distances within a triplet of homologs is a common operation that is used for example to determine which of t...
Christophe Dessimoz, Manuel Gil, Adrian Schneider,...
VIS
2007
IEEE
188views Visualization» more  VIS 2007»
16 years 5 months ago
Fast Filament Tracking Using Graphics Hardware
Recent developments in biomedical imaging are producing massive data sets containing structures, such as fine filaments, that are difficult to visualize. In this paper, we describ...
David M. Mayerich, Zeki Melek, John Keyser