Sciweavers

612 search results - page 34 / 123
» Hardness assumptions in the foundations of theoretical compu...
Sort
View
ICS
2003
Tsinghua U.
14 years 28 days ago
miNI: reducing network interface memory requirements with dynamic handle lookup
Recent work in low-latency, high-bandwidth communication systems has resulted in building user–level Network InControllers (NICs) and communication abstractions that support dir...
Reza Azimi, Angelos Bilas
IPPS
2009
IEEE
14 years 2 months ago
Robust sequential resource allocation in heterogeneous distributed systems with random compute node failures
—The problem of finding efficient workload distribution techniques is becoming increasingly important today for heterogeneous distributed systems where the availability of comp...
Vladimir Shestak, Edwin K. P. Chong, Anthony A. Ma...
CSE
2009
IEEE
13 years 11 months ago
Extended Dempster-Shafer Theory in Context Reasoning for Ubiquitous Computing Environments
—Context, the pieces of information that capture the characteristics of ubiquitous computing environment, is often imprecise and incomplete due to user mobility, unreliable wirel...
Daqiang Zhang, Jiannong Cao, Jingyu Zhou, Minyi Gu...
FOCS
2003
IEEE
14 years 1 months ago
Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds
We consider the problem of constructing a general protocol for secure two-party computation in a way that preserves security under concurrent composition. In our treatment, we foc...
Rafael Pass, Alon Rosen
IFIPTCS
2010
13 years 5 months ago
Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility
Most highly dynamic infrastructure-less networks have in common that the assumption of connectivity does not necessarily hold at a given instant. Still, communication routes can be...
Arnaud Casteigts, Paola Flocchini, Bernard Mans, N...