Sciweavers

89222 search results - page 74 / 17845
» Which
Sort
View
COMPUTING
2002
80views more  COMPUTING 2002»
13 years 8 months ago
A Method for Approximate Inversion of the Hyperbolic CDF
It has been observed by E. Eberlein and U. Keller that the hyperbolic distribution fits logarithmic rates of returns of a stock much better than the normal distribution. We give a...
Gunther Leobacher, Friedrich Pillichshammer
ENTCS
2000
109views more  ENTCS 2000»
13 years 8 months ago
Forward and Backward Chaining in Linear Logic
Abstract. Logic programming languages based on linear logic are of both theoretical and practical interest, particulaly because such languages can be seen as providing a logical ba...
James Harland, David J. Pym, Michael Winikoff
DAM
2002
78views more  DAM 2002»
13 years 8 months ago
Uniquely 2-list colorable graphs
A graph is said to be uniquely list colorable, if it admits a list assignment which induces a unique list coloring. We study uniquely list colorable graphs with a restriction on t...
Yashar Ganjali, Mohammad Ghebleh, Hossein Hajiabol...
DM
2002
104views more  DM 2002»
13 years 8 months ago
A polynomial time algorithm for determining zero Euler-Petrie genus of an Eulerian graph
A dual-eulerian graph is a plane graph which has an ordering defined on its edge set which forms simultaneously an Euler circuit in the graph and an euler circuit in the dual grap...
Brigitte Servatius, Herman Servatius
GC
2002
Springer
13 years 8 months ago
Ramsey-Type Results for Unions of Comparability Graphs
Given a graph on n vertices which is the union of two comparability graphs on the same vertex set, it always contains a clique or independent set of size n 1 3 . On the other hand...
Adrian Dumitrescu, Géza Tóth