Sciweavers

13593 search results - page 246 / 2719
» Performance Analysis of MD5
Sort
View
HIPC
2009
Springer
15 years 4 months ago
Comparing the performance of clusters, Hadoop, and Active Disks on microarray correlation computations
Abstract--Microarray-based comparative genomic hybridization (aCGH) offers an increasingly fine-grained method for detecting copy number variations in DNA. These copy number variat...
Jeffrey A. Delmerico, Nathanial A. Byrnes, Andrew ...
PLDI
2005
ACM
16 years 6 days ago
Automatic pool allocation: improving performance by controlling data structure layout in the heap
This paper describes Automatic Pool Allocation, a transformation framework that segregates distinct instances of heap-based data structures into seperate memory pools and allows h...
Chris Lattner, Vikram S. Adve
DOCENG
2008
ACM
15 years 8 months ago
Improving query performance on XML documents: a workload-driven design approach
As XML has emerged as a data representation format and as great quantities of data have been stored in the XML format, XML document design has become an important and evident issu...
Rebeca Schroeder, Ronaldo dos Santos Mello
ACMACE
2006
ACM
16 years 19 days ago
An empirical evaluation of TCP performance in online games
A fundamental design question to ask in the development of a network game is—Which transport protocol should be used—TCP, UDP, or some other protocols? Seeking an objective an...
Kuan-Ta Chen, Chun-Ying Huang, Polly Huang, Chin-L...
ICRA
2006
IEEE
90views Robotics» more  ICRA 2006»
16 years 21 days ago
A Performance Comparison of Three Algorithms for Proximity Queries Relative to Convex Polyhedra
— This paper presents a comparative analysis relative to the experimental performances of an asymptotically fast and incremental algorithm, recently developed to compute collisio...
Stefano Carpin, Claudio Mirolo, Enrico Pagello