Sciweavers

2703 search results - page 403 / 541
» Optimizing memory transactions
Sort
View
128
Voted
DAGSTUHL
2008
15 years 4 months ago
Fast (Parallel) Dense Linear System Solvers in C-XSC Using Error Free Transformations and BLAS
Existing selfverifying solvers for dense linear (interval-)systems in C-XSC provide high accuracy, but are rather slow. A new set of solvers is presented, which are a lot faster th...
Walter Krämer, Michael Zimmer
106
Voted
NETWORKING
2007
15 years 4 months ago
Delivery Guarantees in Predictable Disruption Tolerant Networks
This article studies disruption tolerant networks (DTNs) where each node knows the probabilistic distribution of contacts with other nodes. It proposes a framework that allows one ...
Jean-Marc François, Guy Leduc
CSREAEEE
2006
120views Business» more  CSREAEEE 2006»
15 years 4 months ago
Object Caching Model for Cell Phone Mobile Database
- Inherent limitations of mobile computing environment such as limited bandwidth, limited resourced mobile phones, and instability of wireless environment require summarized mobile...
Khubaib Ahmed Qureshi
141
Voted
GEOINFO
2004
15 years 4 months ago
Non-Uniform Mesh Simplification Using Adaptative Merge Procedures
: The performance of a walkthrough over terrain models is deeply influenced by the real scenario high level of details. To guarantee natural and smooth changes in a sequence of sce...
Flávio Mello, Edilberto Strauss, Antonio A....
133
Voted
ICISC
2004
120views Cryptology» more  ICISC 2004»
15 years 4 months ago
Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields
Abstract. We consider the use of Jacobian coordinates for Tate pairing over general characteristics. The idea of encapsulated double-andline computation and add-and-line computatio...
Sanjit Chatterjee, Palash Sarkar, Rana Barua