Sciweavers

598 search results - page 2 / 120
» Stably compact spaces
Sort
View
90
Voted
CORR
2006
Springer
120views Education» more  CORR 2006»
14 years 11 months ago
Logic Column 15: Coalgebras and Their Logics
of proposed research. A short bibliography is optional. Domain theory has been developed around 40 years since 1970s by D. Scott, and S. Abramsky revealed the "junction betwee...
Alexander Kurz
70
Voted
ACS
2007
14 years 11 months ago
Choiceless, Pointless, but not Useless: Dualities for Preframes
We provide the appropriate common ‘(pre)framework’ for various central results of domain theory and topology, like the Lawson duality of continuous domains, the Hofmann–Lawso...
Marcel Erné
82
Voted
BMCBI
2008
104views more  BMCBI 2008»
14 years 11 months ago
Evolutionary Pareto-optimization of stably folding peptides
Background: As a rule, peptides are more flexible and unstructured than proteins with their substantial stabilizing hydrophobic cores. Nevertheless, a few stably folding peptides ...
Wolfram Gronwald, Tim Hohm, Daniel Hoffmann
60
Voted
MLQ
2002
102views more  MLQ 2002»
14 years 10 months ago
Products of Compact Spaces and the Axiom of Choice
We study the Tychonoff Compactness Theorem for several different definitions of a compact space.
Omar de la Cruz, Eric J. Hall, Paul E. Howard, Kyr...
120
Voted
CORR
2012
Springer
228views Education» more  CORR 2012»
13 years 6 months ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled