Sciweavers

3394 search results - page 613 / 679
» A Modal Model of Memory
Sort
View
115
Voted
CORR
2008
Springer
111views Education» more  CORR 2008»
15 years 3 months ago
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
David Eppstein, Michael T. Goodrich, Darren Strash
122
Voted
ENTCS
2006
173views more  ENTCS 2006»
15 years 3 months ago
Formal Security Analysis for Ad-Hoc Networks
In ad-hoc networks, autonomous wireless nodes can communicate by forwarding messages for each other. For routing protocols in this setting, it is known that a malicious node can p...
Sebastian Nanz, Chris Hankin
CONCURRENCY
2007
103views more  CONCURRENCY 2007»
15 years 3 months ago
JaMP: an implementation of OpenMP for a Java DSM
In this paper we present JaMP, an adaptation of the OpenMP standard. JaMP is fitted to Jackal, a software-based DSM implementation for Java. While the set of supported directives...
Michael Klemm, Matthias Bezold, Ronald Veldema, Mi...
CORR
2007
Springer
124views Education» more  CORR 2007»
15 years 3 months ago
Graph-Based Decoding in the Presence of ISI
We propose a new graph representation for ISI channels that can be used for combined equalization and decoding by linear programming (LP) or iterative message-passing (IMP) decodi...
Mohammad H. Taghavi, Paul H. Siegel
JPDC
2008
167views more  JPDC 2008»
15 years 3 months ago
A performance study of general-purpose applications on graphics processors using CUDA
Graphics processors (GPUs) provide a vast number of simple, data-parallel, deeply multithreaded cores and high memory bandwidths. GPU architectures are becoming increasingly progr...
Shuai Che, Michael Boyer, Jiayuan Meng, David Tarj...