Sciweavers

6248 search results - page 1188 / 1250
» Programming in a data factory
Sort
View
RECOMB
2006
Springer
14 years 9 months ago
A Parsimony Approach to Genome-Wide Ortholog Assignment
The assignment of orthologous genes between a pair of genomes is a fundamental and challenging problem in comparative genomics, since many computational methods for solving various...
Zheng Fu, Xin Chen, Vladimir Vacic, Peng Nan, Yang...
OSDI
2006
ACM
14 years 9 months ago
EXPLODE: A Lightweight, General System for Finding Serious Storage System Errors
Storage systems such as file systems, databases, and RAID systems have a simple, basic contract: you give them data, they do not lose or corrupt it. Often they store the only copy...
Junfeng Yang, Can Sar, Dawson R. Engler
OSDI
2004
ACM
14 years 9 months ago
CP-Miner: A Tool for Finding Copy-paste and Related Bugs in Operating System Code
Copy-pasted code is very common in large software because programmers prefer reusing code via copy-paste in order to reduce programming effort. Recent studies show that copy-paste...
Zhenmin Li, Shan Lu, Suvda Myagmar, Yuanyuan Zhou
ICALP
2009
Springer
14 years 9 months ago
Universal Succinct Representations of Trees?
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
Arash Farzan, Rajeev Raman, S. Srinivasa Rao
ICALP
2009
Springer
14 years 9 months ago
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
Nir Ailon, Edo Liberty
« Prev « First page 1188 / 1250 Last » Next »