Sciweavers

12742 search results - page 77 / 2549
» On canonical number systems
Sort
View
SIAMDM
2000
103views more  SIAMDM 2000»
14 years 9 months ago
Directional Routing via Generalized st-Numberings
We present a mathematical model for network routing based on generating paths in a consistent direction. Our development is based on an algebraic and geometric framework for defini...
Fred S. Annexstein, Kenneth A. Berman
COCO
2009
Springer
105views Algorithms» more  COCO 2009»
15 years 4 months ago
Planar Graph Isomorphism is in Log-Space
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Th...
BMCBI
2007
93views more  BMCBI 2007»
14 years 10 months ago
Representing default knowledge in biomedical ontologies: application to the integration of anatomy and phenotype ontologies
Background: Current efforts within the biomedical ontology community focus on achieving interoperability between various biomedical ontologies that cover a range of diverse domain...
Robert Hoehndorf, Frank Loebe, Janet Kelso, Heinri...
BSL
2004
110views more  BSL 2004»
14 years 9 months ago
Notes on quasiminimality and excellence
This paper ties together much of the model theory of the last 50 years. Shelah's attempts to generalize the Morley theorem beyond first order logic led to the notion of excel...
John T. Baldwin
CIE
2007
Springer
15 years 4 months ago
Binary Trees and (Maximal) Order Types
Concerning the set of rooted binary trees, one shows that Higman’s Lemma and Dershowitz’s recursive path ordering can be used for the decision of its maximal order type accordi...
Gyesik Lee