Sciweavers

3256 search results - page 505 / 652
» Mixin-Based Programming in C
Sort
View
RECOMB
2005
Springer
14 years 9 months ago
Alignment of Optical Maps
We introduce a new scoring method for calculation of alignments of optical maps. Missing cuts, false cuts, and sizing errors present in optical maps are addressed by our alignment...
Anton Valouev, Lei Li, Yu-Chi Liu, David C. Schwar...
CADE
2006
Springer
14 years 9 months ago
Solving Sparse Linear Constraints
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
Shuvendu K. Lahiri, Madanlal Musuvathi
STOC
2004
ACM
122views Algorithms» more  STOC 2004»
14 years 9 months ago
Estimating the weight of metric minimum spanning trees in sublinear-time
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
Artur Czumaj, Christian Sohler
SIGMOD
2008
ACM
143views Database» more  SIGMOD 2008»
14 years 9 months ago
A case study in database reliability: component types, usage profiles, and testing
Data management lies at the core of most modern information technology deployments. Accordingly, the reliability of the database management system (DBMS) is critical to the reputa...
C. A. Taylor, Mechelle Gittens, Andriy V. Miransky...
SIGMOD
2004
ACM
166views Database» more  SIGMOD 2004»
14 years 9 months ago
Fast Computation of Database Operations using Graphics Processors
We present new algorithms on commodity graphics processors to perform fast computation of several common database operations. Specifically, we consider operations such as conjunct...
Naga K. Govindaraju, Brandon Lloyd, Wei Wang 0010,...