Sciweavers

48 search results - page 10 / 10
» ejc 2006
Sort
View
EJC
2006
15 years 3 months ago
Counting connected graphs asymptotically
We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...
Remco van der Hofstad, Joel Spencer
129
Voted
EJC
2006
15 years 3 months ago
The positive Bergman complex of an oriented matroid
We study the positive Bergman complex B+ (M) of an oriented matroid M, which is a certain subcomplex of the Bergman complex B(M) of the underlying unoriented matroid M. The positiv...
Federico Ardila, Caroline J. Klivans, Lauren Willi...
EJC
2007
15 years 5 months ago
On the Construction of Ontologies based on Natural Language Semantic
instrumental roles in titles of medical abstracts: a combined conceptual and modelling UML approach Topic – This paper provides a detailed description of the instrumental role in...
Terje Aaberge