Sciweavers

36781 search results - page 139 / 7357
» Parameterizing by the Number of Numbers
Sort
View
DLOG
2001
14 years 1 days ago
Optimizing Reasoning in Description Logics with Qualified Number Restrictions
In this extended abstract an optimization technique, the so-called signature calculus, for reasoning with number restrictions in description logics is investigated. The calculus i...
Volker Haarslev, Ralf Möller
ESANN
2000
14 years 1 hour ago
Self-Organisation in the SOM with a finite number of possible inputs
Abstract. Given a one dimensional SOM with a monotonically decreasing neighbourhood and an input distribution which is not Lebesque continuous, a set of su cient conditions and a T...
John A. Flanagan
ARSCOM
2008
103views more  ARSCOM 2008»
13 years 10 months ago
Estimating the number of graphs containing very long induced paths
Let P(n, k) denote the number of graphs on n + k vertices that contain Pn, a path on n vertices, as an induced subgraph. In this note we will find upper and lower bounds for P(n, ...
Steven Butler
DCG
2010
61views more  DCG 2010»
13 years 10 months ago
Vertex Numbers of Weighted Faces in Poisson Hyperplane Mosaics
In the random mosaic generated by a stationary Poisson hyperplane process in Rd , we consider the typical k-face weighted by the j-dimensional volume of the j-skeleton (0 j k d)...
Rolf Schneider
DAM
2008
74views more  DAM 2008»
13 years 10 months ago
A distributional study of the path edge-covering numbers for random trees
Abstract. We study for various tree families the distribution of the number of edgedisjoint paths required to cover the edges of a random tree of size n. For all tree families cons...
Alois Panholzer