Sciweavers

4759 search results - page 890 / 952
» Parallelizing the Phylogeny Problem
Sort
View
SIGOPS
2010
162views more  SIGOPS 2010»
13 years 8 months ago
Visual and algorithmic tooling for system trace analysis: a case study
Despite advances in the application of automated statistical and machine learning techniques to system log and trace data there will always be a need for human analysis of machine...
Wim De Pauw, Steve Heisig
SIGMOD
2011
ACM
299views Database» more  SIGMOD 2011»
13 years 1 months ago
Processing theta-joins using MapReduce
Joins are essential for many data analysis tasks, but are not supported directly by the MapReduce paradigm. While there has been progress on equi-joins, implementation of join alg...
Alper Okcan, Mirek Riedewald
PODC
2009
ACM
14 years 10 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...
SPAA
2004
ACM
14 years 3 months ago
Cache-oblivious shortest paths in graphs using buffer heap
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
Rezaul Alam Chowdhury, Vijaya Ramachandran
HPCC
2011
Springer
12 years 10 months ago
Achieving Performance and Availability Guarantees with Spot Instances
Abstract—In the Infrastructure-as-a-Service (IaaS) cloud computing market, spot instances refer to virtual servers that are rented via an auction. Spot instances allow IaaS provi...
Michele Mazzucco, Marlon Dumas