Sciweavers

427 search results - page 64 / 86
» Hybrid Soft Computing: Where are we Going
Sort
View
NETWORKS
2008
13 years 7 months ago
New dynamic programming algorithms for the resource constrained elementary shortest path problem
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
Giovanni Righini, Matteo Salani
ASIACRYPT
2007
Springer
13 years 11 months ago
Simple and Efficient Perfectly-Secure Asynchronous MPC
Secure multi-party computation (MPC) allows a set of n players to securely compute an agreed function of their inputs, even when up to t players are under the control of an adversa...
Zuzana Beerliová-Trubíniová, ...
PPOPP
2003
ACM
14 years 24 days ago
Optimizing data aggregation for cluster-based internet services
Large-scale cluster-based Internet services often host partitioned datasets to provide incremental scalability. The aggregation of results produced from multiple partitions is a f...
Lingkun Chu, Hong Tang, Tao Yang, Kai Shen
SIGUCCS
2003
ACM
14 years 24 days ago
What's old is new again: training is the information technology constant
This paper is an account of some of the more instructive experiences we gained as we sought to ensure that our information technology training programs kept pace with a fast chang...
George Bradford

Tutorial
2031views
15 years 2 months ago
Gradient Domain Manipulation Techniques in Vision and Graphics
The last decade has seen a tremendous interest in gradient domain manipulation techniques for applications in vision and graphics including retinex, high dynamic range (HDR) tone m...
Amit Agrawal and Ramesh Raskar