396 search results - page 46 / 80 » Crossing Numbers |
123
Voted
JGAA
1998
15 years 10 days ago
1998
An orthogonal drawing of a graph is an embedding of the graph in the two-dimensional grid such that edges are routed along grid-lines. In this paper we explore lower bounds for or...
121
click to vote
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
101
click to vote
INFOCOM
1996
IEEE
15 years 4 months ago
1996
IEEE
In this paper, we propose and evaluate ARIES, a heuristic for updating multicast trees dynamically in large point-to-point networks. The algorithm is based on monitoring the accum...
94
Voted
NIPS
2003
15 years 2 months ago
2003
We present a Bayesian approach to color constancy which utilizes a nonGaussian probabilistic model of the image formation process. The parameters of this model are estimated direc...
104
Voted
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...