Sciweavers

951 search results - page 109 / 191
» On the Computation of Correctly-Rounded Sums
Sort
View
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
15 years 11 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking
OOPSLA
2009
Springer
15 years 11 months ago
A market-based approach to software evolution
Software correctness has bedeviled the field of computer science since its inception. Software complexity has increased far more quickly than our ability to control it, reaching ...
David F. Bacon, Yiling Chen, David C. Parkes, Malv...
SIGIR
2006
ACM
15 years 10 months ago
AggregateRank: bringing order to web sites
Since the website is one of the most important organizational structures of the Web, how to effectively rank websites has been essential to many Web applications, such as Web sear...
Guang Feng, Tie-Yan Liu, Ying Wang, Ying Bao, Zhim...
SIGMOD
1997
ACM
107views Database» more  SIGMOD 1997»
15 years 8 months ago
Range Queries in OLAP Data Cubes
A range query applies an aggregation operation over all selected cells of an OLAP data cube where the selection is speci ed by providing ranges of values for numeric dimensions. W...
Ching-Tien Ho, Rakesh Agrawal, Nimrod Megiddo, Ram...
COLT
2008
Springer
15 years 6 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim