973 search results - page 59 / 195 » New Bounds on Crossing Numbers |
103
click to vote
CGF
2006
14 years 12 months ago
2006
We present a novel algorithm to compute cache-efficient layouts of bounding volume hierarchies (BVHs) of polygonal models. Our approach does not make any assumptions about the cac...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
We provide new and tight lower bounds on the ability of players to implement equilibria using cheap talk, that is, just allowing communication among the players. One of our main r...
150
click to vote
FMSB
2008
15 years 1 months ago
2008
We introduce bounded asynchrony, a notion of concurrency tailored to the modeling of biological cell-cell interactions. Bounded asynchrony is the result of a scheduler that bounds ...
115
click to vote
STOC
2012
ACM
13 years 2 months ago
2012
ACM
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
COCO
1990
Springer
15 years 3 months ago
1990
Springer
d Abstract) Eric Allender Christopher Wilson Department of Computer Science Department of Computer Rutgers University and Information Science New Brunswick, NJ 08903, USA Universit...