2252 search results - page 302 / 451 » Lower Bounds for Dynamic Algorithms |
130
Voted
AINA
2010
IEEE
15 years 7 months ago
2010
IEEE
One important challenge in wireless ad hoc networks is to achieve collision free communication. Many MAC layer protocols have been proposed by considering various communication mod...
234
click to vote
ICDE
2008
IEEE
16 years 4 months ago
2008
IEEE
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...
123
click to vote
KDD
2009
ACM
15 years 10 months ago
2009
ACM
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...
153
Voted
ESCAPE
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. In the online capacitated interval coloring problem, a sequence of requests arrive online. Each of the requests is an interval Ij ⊆ {1, 2, . . . , n} with bandwidth bj....
134
Voted
ECCV
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Condensation is a popular algorithm for sequential inference that resamples a sampled representation of the posterior. The algorithm is known to be asymptotically correct...