Sciweavers

747 search results - page 48 / 150
» Theory and Construction of Molecular Computers
Sort
View
SODA
2010
ACM
200views Algorithms» more  SODA 2010»
14 years 6 months ago
Algorithms for ray class groups and Hilbert class fields
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...
Sean Hallgren, Kirsten Eisentraeger
AISB
2008
Springer
13 years 10 months ago
Substitution for Fraenkel-Mostowski foundations
Abstract. A fundamental and unanalysed logical concept is substitution. This seemingly innocuous operation -- substituting a variable for a term or valuating a variable to an eleme...
Murdoch Gabbay, Michael Gabbay
LATA
2009
Springer
14 years 3 months ago
From Gene Trees to Species Trees through a Supertree Approach
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
Celine Scornavacca, Vincent Berry, Vincent Ranwez
SP
2002
IEEE
109views Security Privacy» more  SP 2002»
13 years 8 months ago
Scalable atomistic simulation algorithms for materials research
A suite of scalable atomistic simulation programs has been developed for materials research based on space-time multiresolution algorithms. Design and analysis of parallel algorit...
Aiichiro Nakano, Rajiv K. Kalia, Priya Vashishta, ...
ISVD
2010
IEEE
13 years 6 months ago
Hydration Shells in Voronoi Tessellations
An interesting property of the Voronoi tessellation is studied in the context of its application to the analysis of hydration shells in computer simulation of solutions. Namely the...
V. P. Voloshin, Alexey V. Anikeenko, Nikolai N. Me...