Sciweavers

2127 search results - page 36 / 426
» Computing large matchings fast
Sort
View
CEAS
2006
Springer
15 years 7 months ago
Fast Uncertainty Sampling for Labeling Large E-mail Corpora
One of the biggest challenges in building effective anti-spam solutions is designing systems to defend against the everevolving bag of tricks spammers use to defeat them. Because ...
Richard Segal, Ted Markowitz, William Arnold
CIKM
2010
Springer
15 years 2 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
140
Voted
BIBE
2004
IEEE
107views Bioinformatics» more  BIBE 2004»
15 years 7 months ago
Fast Parallel Molecular Algorithms for DNA-based Computation: Factoring Integers
The RSA public-key cryptosystem is an algorithm that converts input data to an unrecognizable encryption and converts the unrecognizable data back into its original decryption form...
Weng-Long Chang, Michael (Shan-Hui) Ho, Minyi Guo
CSDA
2006
85views more  CSDA 2006»
15 years 3 months ago
Fast and compact smoothing on large multidimensional grids
A framework of penalized generalized linear models and tensor products of B-splines with roughness penalties allows effective smoothing of data in multidimensional arrays. A strai...
Paul H. C. Eilers, Iain D. Currie, María Du...
CORR
2008
Springer
185views Education» more  CORR 2008»
15 years 3 months ago
Realizing Fast, Scalable and Reliable Scientific Computations in Grid Environments
The practical realization of managing and executing large scale scientific computations efficiently and reliably is quite challenging. Scientific computations often invo...
Yong Zhao, Ioan Raicu, Ian T. Foster, Mihael Hateg...