36781 search results - page 7 / 7357 » Parameterizing by the Number of Numbers |
COLING
2010
13 years 2 months ago
2010
Tibetan word segmentation is essential for Tibetan information processing. People mainly use the basic machine matching method which is based on dictionary to segment Tibetan word...
GD
2005
Springer
14 years 1 months ago
2005
Springer
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
DM
2000
13 years 7 months ago
2000
We study the number of ways to factor a natural number n into an ordered product of integers, each factor greater than one, denoted by H(n). This counting function from number the...
ALGORITHMICA
2011
13 years 2 months ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
ENDM
2008
13 years 7 months ago
2008
For n 27 we present exact values for the maximum number h(n) of halving lines and h(n) of halving pseudolines, determined by n points in the plane. For this range of values of n ...