Sciweavers

374 search results - page 74 / 75
» Fast separable factorization and applications
Sort
View
DOLAP
2006
ACM
13 years 9 months ago
Building a web warehouse for accessibility data
As more and more information is available on the web, it is a problem that many web resources are not accessible, i.e., are not usable for users with special needs. For example, f...
Christian Thomsen, Torben Bach Pedersen
SOSP
1993
ACM
13 years 7 months ago
Improving IPC by Kernel Design
Inter-process communication (ipc) has to be fast and e ective, otherwise programmers will not use remote procedure calls(RPC),multithreadingand multitasking adequately. Thus ipc p...
Jochen Liedtke
BMCBI
2010
139views more  BMCBI 2010»
13 years 6 months ago
A highly efficient multi-core algorithm for clustering extremely large datasets
Background: In recent years, the demand for computational power in computational biology has increased due to rapidly growing data sets from microarray and other high-throughput t...
Johann M. Kraus, Hans A. Kestler
SPE
1998
129views more  SPE 1998»
13 years 5 months ago
Timing Trials, or the Trials of Timing: Experiments with Scripting and User-Interface Languages
This paper describes some basic experiments to see how fast various popular scripting and user-interface languages run on a spectrum of representative tasks. We found enormous var...
Brian W. Kernighan, Christopher J. Van Wyk
SIGSOFT
2010
ACM
13 years 3 months ago
Growth of newcomer competence: challenges of globalization
The transfer of entire projects to offshore locations, the aging and renewal of core developers in legacy products, the recruiting in fast growing Internet companies, and the part...
Minghui Zhou, Audris Mockus