Sciweavers

2689 search results - page 190 / 538
» ParalleX: A Study of A New Parallel Computation Model
Sort
View
SIGMOD
2004
ACM
166views Database» more  SIGMOD 2004»
16 years 6 months ago
Fast Computation of Database Operations using Graphics Processors
We present new algorithms on commodity graphics processors to perform fast computation of several common database operations. Specifically, we consider operations such as conjunct...
Naga K. Govindaraju, Brandon Lloyd, Wei Wang 0010,...
186
Voted
KBSE
2010
IEEE
15 years 5 months ago
A bounded statistical approach for model checking of unbounded until properties
We study the problem of statistical model checking of probabilistic systems for PCTL unbounded until property P1p(ϕ1 U ϕ2) (where 1 ∈ {<, ≤, >, ≥}) using the computa...
Ru He, Paul Jennings, Samik Basu, Arka P. Ghosh, H...
ICALP
2005
Springer
16 years 4 days ago
Computationally Sound Implementations of Equational Theories Against Passive Adversaries
In this paper we study the link between formal and cryptographic models for security protocols in the presence of a passive adversary. In contrast to other works, we do not conside...
Mathieu Baudet, Véronique Cortier, Steve Kr...
NETWORKING
2011
14 years 9 months ago
Modelling and Evaluation of CCN-Caching Trees
Networking Named Content (NNC) was recently proposed as a new networking paradigm to realise Content Centric Networks (CCNs). The new paradigm changes much about the current Intern...
Ioannis Psaras, Richard G. Clegg, Raul Landa, Wei ...
DCOSS
2009
Springer
15 years 11 months ago
Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks
We study the problem of computing a family of connected dominating sets in wireless sensor networks (WSN) in a distributed manner. A WSN is modelled as a unit disk graph G = (V, E)...
Kamrul Islam, Selim G. Akl, Henk Meijer