Sciweavers

1368 search results - page 72 / 274
» Generalized Rook Polynomials
Sort
View
ISAAC
2009
Springer
98views Algorithms» more  ISAAC 2009»
15 years 10 months ago
On the Tightness of the Buhrman-Cleve-Wigderson Simulation
Abstract. Buhrman, Cleve and Wigderson gave a general communication protocol for block-composed functions f(g1(x1 , y1 ), · · · , gn(xn , yn )) by simulating a decision tree com...
Shengyu Zhang
EOR
2011
127views more  EOR 2011»
14 years 11 months ago
Methodology for determining the acceptability of system designs in uncertain environments
In practice, managers often wish to ascertain that a particular engineering design of a production system meets their requirements. The future environment of this design is likely...
Jack P. C. Kleijnen, Henri Pierreval, Jin Zhang
INFOCOM
2012
IEEE
13 years 6 months ago
Approximately optimal adaptive learning in opportunistic spectrum access
—In this paper we develop an adaptive learning algorithm which is approximately optimal for an opportunistic spectrum access (OSA) problem with polynomial complexity. In this OSA...
Cem Tekin, Mingyan Liu
RECOMB
2012
Springer
13 years 6 months ago
Estimating the Accuracy of Multiple Alignments and its Use in Parameter Advising
We develop a novel and general approach to estimating the accuracy of protein multiple sequence alignments without knowledge of a reference alignment, and use our approach to addre...
Dan F. DeBlasio, Travis J. Wheeler, John D. Kececi...
ICDE
2008
IEEE
127views Database» more  ICDE 2008»
16 years 5 months ago
Efficient Processing of Top-k Queries in Uncertain Databases
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
Ke Yi, Feifei Li, George Kollios, Divesh Srivastav...