Sciweavers

739 search results - page 122 / 148
» Sorting Algorithms
Sort
View
RECOMB
2008
Springer
14 years 7 months ago
Hurdles Hardly Have to Be Heeded
Abstract. As data about genomic architecture accumulates, genomic rearrangements have attracted increasing attention. One of the main rearrangement mechanisms, inversions (also cal...
Krister M. Swenson, Yu Lin, Vaibhav Rajan, Bernard...
SIGMOD
2007
ACM
190views Database» more  SIGMOD 2007»
14 years 7 months ago
Map-reduce-merge: simplified relational data processing on large clusters
Map-Reduce is a programming model that enables easy development of scalable parallel applications to process vast amounts of data on large clusters of commodity machines. Through ...
Hung-chih Yang, Ali Dasdan, Ruey-Lung Hsiao, Dougl...
SIGMOD
2006
ACM
117views Database» more  SIGMOD 2006»
14 years 7 months ago
Database support for matching: limitations and opportunities
We define a match join of R and S with predicate to be a subset of the -join of R and S such that each tuple of R and S contributes to at most one result tuple. Match joins and t...
Ameet Kini, Srinath Shankar, Jeffrey F. Naughton, ...
SIGMOD
2005
ACM
107views Database» more  SIGMOD 2005»
14 years 7 months ago
Relational Confidence Bounds Are Easy With The Bootstrap
Statistical estimation and approximate query processing have become increasingly prevalent applications for database systems. However, approximation is usually of little use witho...
Abhijit Pol, Chris Jermaine
SI3D
2010
ACM
14 years 2 months ago
Stochastic transparency
Stochastic transparency provides a unified approach to orderindependent transparency, anti-aliasing, and deep shadow maps. It augments screen-door transparency using a random sub...
Eric Enderton, Erik Sintorn, Peter Shirley, David ...