Sciweavers

1385 search results - page 245 / 277
» Clustering by Random Projections
Sort
View
179
Voted
ICDCS
2012
IEEE
13 years 6 months ago
Combining Partial Redundancy and Checkpointing for HPC
Today’s largest High Performance Computing (HPC) systems exceed one Petaflops (1015 floating point operations per second) and exascale systems are projected within seven years...
James Elliott, Kishor Kharbas, David Fiala, Frank ...
158
Voted
ESA
1995
Springer
182views Algorithms» more  ESA 1995»
15 years 7 months ago
A Geometric Approach to Betweenness
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
Benny Chor, Madhu Sudan
142
Voted
SIGSOFT
1995
ACM
15 years 7 months ago
An Experiment to Assess the Cost-Benefits of Code Inspections in Large Scale Software Development
—We conducted a long-term experiment to compare the costs and benefits of several different software inspection methods. These methods were applied by professional developers to ...
Adam A. Porter, Harvey P. Siy, Carol A. Toman, Law...
135
Voted
APPROX
2010
Springer
139views Algorithms» more  APPROX 2010»
15 years 5 months ago
Two-Source Extractors Secure against Quantum Adversaries
We initiate the study of multi-source extractors in the quantum world. In this setting, our goal is to extract random bits from two independent weak random sources, on which two q...
Roy Kasher, Julia Kempe
129
Voted
BMCBI
2010
154views more  BMCBI 2010»
15 years 3 months ago
An algorithm for automated closure during assembly
Background: Finishing is the process of improving the quality and utility of draft genome sequences generated by shotgun sequencing and computational assembly. Finishing can invol...
Sergey Koren, Jason R. Miller, Brian Walenz, Grang...