499 search results - page 14 / 100 » On the Decay of Crossing Numbers |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
This paper presents several novel theoretical results regarding the recovery of a low-rank matrix from just a few measurements consisting of linear combinations of the matrix entr...
EDBT
2008
ACM
14 years 8 months ago
2008
ACM
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...
ENDM
2008
13 years 8 months ago
2008
The nth crossing number of a graph G, denoted crn(G), is the minimum number of crossings in a drawing of G on an orientable surface of genus n. We prove that for every a > b &g...
COMPGEOM
1996
ACM
14 years 6 days ago
1996
ACM
Given a simple arrangementof n pseudolines in the Euclidean plane, associate with line i the list i of the lines crossing i in the order of the crossings on line i. i = ( i 1; i 2;...
ATAL
2004
Springer
14 years 1 months ago
2004
Springer
The development of autonomous multi-agent systems acting upon the interests of one or more users involves the elicitation of preferences of these users. In decision theory, models...