Sciweavers

13603 search results - page 2614 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
NDSS
2008
IEEE
15 years 4 months ago
Halo: High-Assurance Locate for Distributed Hash Tables
We study the problem of reliably searching for resources in untrusted peer-to-peer networks, where a significant portion of the participating network nodes may act maliciously to...
Apu Kapadia, Nikos Triandopoulos
P2P
2008
IEEE
137views Communications» more  P2P 2008»
15 years 4 months ago
Hierarchical Codes: How to Make Erasure Codes Attractive for Peer-to-Peer Storage Systems
Redundancy is the basic technique to provide reliability in storage systems consisting of multiple components. A redundancy scheme defines how the redundant data are produced and...
Alessandro Duminuco, Ernst Biersack
TRIDENTCOM
2008
IEEE
15 years 4 months ago
Virtual integrated TCP testbed (VITT)
Research on TCP performance relies either on simulation programs, which run on a single machine, or on the use of real testbeds, where different machines represent different netwo...
Carlo Caini, Rosario Firrincieli, Renzo Davoli, Da...
CIBCB
2007
IEEE
15 years 4 months ago
Modeling protein-DNA binding time in Stochastic Discrete Event Simulation of Biological Processes
Abstract— This paper presents a parametric model to estimate the DNA-protein binding time using the DNA and protein structures and details of the binding site. To understand the ...
Preetam Ghosh, Samik Ghosh, Kalyan Basu, Sajal K. ...
CVPR
2007
IEEE
15 years 4 months ago
Hierarchical Structuring of Data on Manifolds
Manifold learning methods are promising data analysis tools. However, if we locate a new test sample on the manifold, we have to find its embedding by making use of the learned e...
Jun Li, Pengwei Hao
« Prev « First page 2614 / 2721 Last » Next »