Sciweavers

622 search results - page 42 / 125
» Fast Computation of Large Distributions and Its Cryptographi...
Sort
View
CVPR
2008
IEEE
16 years 1 months ago
A Parallel Decomposition Solver for SVM: Distributed dual ascend using Fenchel Duality
We introduce a distributed algorithm for solving large scale Support Vector Machines (SVM) problems. The algorithm divides the training set into a number of processing nodes each ...
Tamir Hazan, Amit Man, Amnon Shashua
ICPP
1995
IEEE
15 years 3 months ago
Hiding Miss Latencies with Multithreading on the Data Diffusion Machine
— Large parallel computers require techniques to tolerate the potentially large latencies of accessing remote data. Multithreadingis onesuch technique. We extend previous studies...
Henk L. Muller, Paul W. A. Stallard, David H. D. W...
ICPADS
2002
IEEE
15 years 4 months ago
Experiences in Building a Scalable Distributed Network Emulation System
Network emulation systems are widely used to explore the behavior of network protocols and to test and evaluate protocol implementations and applications. The major problem of net...
Pei Zheng, Lionel M. Ni
SIGMOD
2010
ACM
255views Database» more  SIGMOD 2010»
15 years 4 months ago
Large graph processing in the cloud
As the study of graphs, such as web and social graphs, becomes increasingly popular, the requirements of efficiency and programming flexibility of large graph processing tasks c...
Rishan Chen, Xuetian Weng, Bingsheng He, Mao Yang
BMCBI
2006
143views more  BMCBI 2006»
14 years 12 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,...