Sciweavers

5898 search results - page 1166 / 1180
» Parallel Computing Environments and Methods
Sort
View
ICPPW
2002
IEEE
15 years 6 months ago
Hebbian Algorithms for a Digital Library Recommendation System
generally meta-data, so that documents on any specific subject can be transparently retrieved. While quality control can in principle still rely on the traditional methods of peer-...
Francis Heylighen, Johan Bollen
112
Voted
MIDDLEWARE
2009
Springer
15 years 6 months ago
Automatic Stress Testing of Multi-tier Systems by Dynamic Bottleneck Switch Generation
Abstract. The performance of multi-tier systems is known to be significantly degraded by workloads that place bursty service demands on system resources. Burstiness can cause queu...
Giuliano Casale, Amir Kalbasi, Diwakar Krishnamurt...
108
Voted
VISUALIZATION
1996
IEEE
15 years 6 months ago
Hierarchical and Parallelizable Direct Volume Rendering for Irregular and Multiple Grids
A general volume rendering technique is described that efficiently produces images of excellent quality from data defined over irregular grids having a wide variety of formats. Re...
Jane Wilhelms, Allen Van Gelder, Paul Tarantino, J...
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 5 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
94
Voted
BMCBI
2008
111views more  BMCBI 2008»
15 years 1 months ago
Probabilistic base calling of Solexa sequencing data
Background: Solexa/Illumina short-read ultra-high throughput DNA sequencing technology produces millions of short tags (up to 36 bases) by parallel sequencing-by-synthesis of DNA ...
Jacques Rougemont, Arnaud Amzallag, Christian Isel...
« Prev « First page 1166 / 1180 Last » Next »