Sciweavers

2743 search results - page 333 / 549
» Minimization of an M-convex Function
Sort
View
EUROPAR
2009
Springer
16 years 21 days ago
Uniform Sampling for Directed P2P Networks
Selecting a random peer with uniform probability across a peer-to-peer (P2P) network is a fundamental function for unstructured search, data replication, and monitoring algorithms....
Cyrus P. Hall, Antonio Carzaniga
IDC
2009
Springer
16 years 21 days ago
Cost of Cooperation for Scheduling Meetings
Scheduling meetings among agents can be represented as a game - the Meetings Scheduling Game (MSG). In its simplest form, the two-person MSG is shown to have a price of anarchy (Po...
Alon Grubshtein, Amnon Meisels
159
Voted
ISW
2009
Springer
16 years 21 days ago
MAC Precomputation with Applications to Secure Memory
We present ShMAC (Shallow MAC), a fixed input length message authentication code that performs most of the computation prior to the availability of the message. Specifically, Sh...
Juan A. Garay, Vladimir Kolesnikov, Rae McLellan
IWANN
2009
Springer
16 years 21 days ago
Feature Selection in Survival Least Squares Support Vector Machines with Maximal Variation Constraints
This work proposes the use of maximal variation analysis for feature selection within least squares support vector machines for survival analysis. Instead of selecting a subset of ...
Vanya Van Belle, Kristiaan Pelckmans, Johan A. K. ...
JSSPP
2009
Springer
16 years 20 days ago
Scalability Analysis of Job Scheduling Using Virtual Nodes
It is important to identify scalability constraints in existing job scheduling software as they are applied to next generation parallel systems. In this paper, we analyze the scala...
Norman Bobroff, Richard Coppinger, Liana Fong, See...