Sciweavers

1385 search results - page 160 / 277
» Clustering by Random Projections
Sort
View
JMLR
2010
115views more  JMLR 2010»
15 years 4 months ago
Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
Pradeep Ravikumar, Alekh Agarwal, Martin J. Wainwr...
IJNSEC
2010
151views more  IJNSEC 2010»
15 years 1 months ago
Performance Evaluation of Mobility Speed over MANET Routing Protocols
Ad-hoc networking is a concept in computer communications. Each node participating in the network acts both as host and a router and must therefore is willing to forward packets f...
Yasser Kamal Hassan, Mohamed Hashim Abd El-Aziz, A...
ICSE
2010
IEEE-ACM
15 years 11 months ago
Summarizing software artifacts: a case study of bug reports
Many software artifacts are created, maintained and evolved as part of a software development project. As software developers work on a project, they interact with existing projec...
Sarah Rastkar, Gail C. Murphy, Gabriel Murray
HPDC
1999
IEEE
15 years 10 months ago
An Evaluation of Linear Models for Host Load Prediction
This paper evaluates linear models for predicting the Digital Unix five-second load average from 1 to 30 seconds into the future. A detailed statistical study of a large number of...
Peter A. Dinda, David R. O'Hallaron
ASIACRYPT
2010
Springer
15 years 4 months ago
Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures
sion of an extended abstract published in Proceedings of Asiacrypt 2010, Springer-Verlag, 2010. Available from the IACR Cryptology ePrint Archive as Report 2010/474. Beginning wit...
Sarah Meiklejohn, Hovav Shacham, David Mandell Fre...