Sciweavers

597 search results - page 95 / 120
» Homomorphisms of random paths
Sort
View
SECON
2007
IEEE
14 years 4 months ago
Log-normal shadowing meets SINR: A numerical study of Capacity in Wireless Networks
— The capacity of wireless multi-hop networks has been studied extensively in recent years. Most existing work tackles the problem from an asymptotic perspective and assumes a si...
Patrick Stuedi, Gustavo Alonso
ATAL
2007
Springer
14 years 4 months ago
An incentive mechanism for message relaying in unstructured peer-to-peer systems
Distributed message relaying is an important function of a peer-topeer system to discover service providers. Existing search protocols in unstructured peer-to-peer systems either ...
Cuihong Li, Bin Yu, Katia P. Sycara
CRYPTO
2007
Springer
132views Cryptology» more  CRYPTO 2007»
14 years 4 months ago
How Should We Solve Search Problems Privately?
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinre...
HPCC
2007
Springer
14 years 4 months ago
A Complex Network-Based Approach for Job Scheduling in Grid Environments
Many optimization techniques have been adopted for efficient job scheduling in grid computing, such as: genetic algorithms, simulated annealing and stochastic methods. Such techni...
Renato Porfirio Ishii, Rodrigo Fernandes de Mello,...
ICPP
2006
IEEE
14 years 3 months ago
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
David A. Bader, Kamesh Madduri