453 search results - page 45 / 91 » Tight bounds for the partial-sums problem |
103
click to vote
TVLSI
1998
15 years 10 days ago
1998
— Excessive instantaneous power consumption may reduce the reliability and performance of VLSI chips. Hence, to synthesize circuits with high reliability, it is imperative to efï...
110
click to vote
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
In high-dimensional classification problems it is infeasible to include enough training samples to cover the class regions densely. Irregularities in the resulting sparse sample d...
100
Voted
STOC
2005
ACM
16 years 1 months ago
2005
ACM
We exhibit three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders. The running time of these algorithms is polynomial in ...
104
Voted
PODS
2003
ACM
16 years 25 days ago
2003
ACM
Computing frequent itemsets and maximally frequent itemsets in a database are classic problems in data mining. The resource requirements of all extant algorithms for both problems...
96
Voted
CORR
2008
Springer
14 years 11 months ago
2008
Springer
We consider the problem of source coding with receiver side information for the simple network proposed by R. Gray and A. Wyner in 1974. In this network, a transmitter must reliabl...