2252 search results - page 331 / 451 » Lower Bounds for Dynamic Algorithms |
123
Voted
AAIM
2009
Springer
15 years 10 months ago
2009
Springer
In the frequency assignment problem we are given a graph representing a wireless network and a sequence of requests, where each request is associated with a vertex. Each request h...
117
Voted
WADS
2007
Springer
15 years 9 months ago
2007
Springer
In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are...
108
Voted
COMPGEOM
2004
ACM
15 years 8 months ago
2004
ACM
We prove that the lines tangent to four possibly intersecting convex polyhedra in 3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
COLT
2004
Springer
15 years 8 months ago
2004
Springer
We consider the problem of learning a general graph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden grap...
130
click to vote
SIGECOM
2003
ACM
15 years 8 months ago
2003
ACM
Combinatorial auctions, where bidders can bid on bundles of items are known to be desirable auction mechanisms for selling items that are complementary and/or substitutable. Howev...