3415 search results - page 568 / 683 » Lower Bounds for Kernelizations |
116
click to vote
DICTA
2003
15 years 5 months ago
2003
In this paper, we present an interpretation of the Maximum Likelihood Estimator (MLE) and the Delogne-K˚asa Estimator (DKE) for circle-parameter estimation via convolution. Under ...
122
click to vote
IJCAI
2001
15 years 5 months ago
2001
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
139
click to vote
NETWORKING
2004
15 years 5 months ago
2004
We consider the problem of traffic grooming in WDM ring networks. Previous studies have focused on minimizing aggregate representations of the network cost. In this work, we consid...
122
click to vote
SODA
2001
ACM
15 years 5 months ago
2001
ACM
This paper relates the notion of fairness in online routing and load balancing to vector majorization as developed by Hardy, Littlewood, and Polya 9]. We de ne -supermajorization ...
135
click to vote
SIROCCO
2004
15 years 5 months ago
2004
We study here the gossiping problem (all-to-all communication) in known radio networks, i.e., when all nodes are aware of the network topology. We start our presentation with a det...