2924 search results - page 172 / 585 » Lower Bounds in Distributed Computing |
ESA
2004
Springer
15 years 6 months ago
2004
Springer
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
98
Voted
SIGECOM
2010
ACM
15 years 6 months ago
2010
ACM
In 1876 Charles Lutwidge Dodgson suggested the intriguing voting rule that today bears his name. Although Dodgson’s rule is one of the most well-studied voting rules, it suffers...
83
Voted
VLDB
2004
ACM
15 years 6 months ago
2004
ACM
Existing studies on time series are based on two categories of distance functions. The first category consists of the Lp-norms. They are metric distance functions but cannot supp...
110
Voted
ICALP
2007
Springer
15 years 7 months ago
2007
Springer
Gaifman’s locality theorem states that every first-order sentence is equivalent to a local sentence. We show that there is no elementary bound on the length of the local sentenc...
108
Voted
ASPDAC
2007
ACM
15 years 5 months ago
2007
ACM
With aggressive scaling down of feature sizes in VLSI fabrication, process variation has become a critical issue in designs. We show that two necessary conditions for the "Ma...