2252 search results - page 224 / 451 » Lower Bounds for Dynamic Algorithms |
155
click to vote
COCOON
2004
Springer
15 years 7 months ago
2004
Springer
In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirement...
139
click to vote
APVIS
2008
15 years 5 months ago
2008
We define the concept of crossing numbers for simultaneous graphs by extending the crossing number problem of traditional graphs. We discuss differences to the traditional crossin...
149
click to vote
CCCG
2008
15 years 5 months ago
2008
A circle C is occluded by a set of circles C1, . . . , Cn if every line that intersects C also intersects at least one of the Ci, i = 1, . . . , n. In this paper, we focus on dete...
133
click to vote
GEM
2007
15 years 5 months ago
2007
We present a method for searching for achordal open paths (snakes) in n-dimensional hypercube graphs (the box). Our technique first obtains a set of exemplary snakes using an evo...
134
Voted
NAACL
2004
15 years 5 months ago
2004
Maximum entropy models are a common modeling technique, but prone to overfitting. We show that using an exponential distribution as a prior leads to bounded absolute discounting b...