Sciweavers

497 search results - page 60 / 100
» On a Parallel Extended Euclidean Algorithm
Sort
View
JPDC
2006
94views more  JPDC 2006»
13 years 7 months ago
Exchanging messages of different sizes
This paper deals with the study of the exchange of messages among a set of processors linked through an interconnection network. We focus on general, non-uniform versions of messa...
Alfredo Goldman, Joseph G. Peters, Denis Trystram
ICPPW
2003
IEEE
14 years 1 months ago
Perfect Secrecy in Wireless Networks
In a classic paper, among a multitude of other security issues, Claude E. Shannon defined perfect secrecy for a pair of secure computers communicating over an insecure link. The ...
Phillip G. Bradford, Olga V. Gavrylyako, Randy K. ...
KDD
2007
ACM
132views Data Mining» more  KDD 2007»
14 years 8 months ago
A scalable modular convex solver for regularized risk minimization
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different r...
Choon Hui Teo, Alex J. Smola, S. V. N. Vishwanatha...
BMCBI
2008
89views more  BMCBI 2008»
13 years 8 months ago
R/parallel - speeding up bioinformatics analysis with R
Background: R is the preferred tool for statistical analysis of many bioinformaticians due in part to the increasing number of freely available analytical methods. Such methods ca...
Gonzalo Vera, Ritsert C. Jansen, Remo Suppi
PODC
2009
ACM
14 years 8 months ago
Brief announcement: minimum spanning trees and cone-based topology control
Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensu...
Alejandro Cornejo, Nancy A. Lynch