Sciweavers

8699 search results - page 374 / 1740
» Elements of the Theory of Computation
Sort
View
ISMB
1996
15 years 8 months ago
The Mathematical Model of Subtractive Hybridization and Its Practical Application
A novel theory of subtractive hybridization including (or based on) the kinetic model of this process was proposed. A computer program modeling the process of subtraction wasdevel...
Olga D. Ermolaeva, Sergey A. Lukyanov, Eugene D. S...
MOC
2000
122views more  MOC 2000»
15 years 6 months ago
Explicit resolutions of cubic cusp singularities
Resolutions of cusp singularities are crucial to many techniques in computational number theory, and therefore finding explicit resolutions of these singularities has been the focu...
H. G. Grundman
FOCS
2010
IEEE
15 years 4 months ago
The Complexity of Distributions
Complexity theory typically studies the complexity of computing a function h(x) : {0, 1}m {0, 1}n of a given input x. A few works have suggested to study the complexity of genera...
Emanuele Viola
SOFSEM
2000
Springer
15 years 10 months ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt
PODS
2012
ACM
240views Database» more  PODS 2012»
13 years 9 months ago
Approximate computation and implicit regularization for very large-scale data analysis
Database theory and database practice are typically the domain of computer scientists who adopt what may be termed an algorithmic perspective on their data. This perspective is ve...
Michael W. Mahoney