Sciweavers

461 search results - page 43 / 93
» Practical polynomial factoring in polynomial time
Sort
View
EOR
2011
127views more  EOR 2011»
14 years 4 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
CATS
2008
14 years 11 months ago
Tractable Cases of the Extended Global Cardinality Constraint
We study the consistency problem for extended global cardinality (EGC) constraints. An EGC constraint consists of a set X of variables, a set D of values, a domain D(x) D for eac...
Marko Samer, Stefan Szeider
TMM
2010
151views Management» more  TMM 2010»
14 years 4 months ago
SPANC: Optimizing Scheduling Delay for Peer-to-Peer Live Streaming
Abstract--In peer-to-peer (P2P) live streaming using unstructured mesh, packet scheduling is an important factor in overall playback delay. In this paper, we propose a scheduling a...
Tammy Kam-Hung Chan, Shueng-Han Gary Chan, Ali C. ...
STOC
2003
ACM
122views Algorithms» more  STOC 2003»
15 years 10 months ago
Learning juntas
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio
STOC
2002
ACM
96views Algorithms» more  STOC 2002»
15 years 10 months ago
Near-optimal sparse fourier representations via sampling
d Abstract] A. C. Gilbert S. Guhay P. Indykz S. Muthukrishnan M. Strauss We give an algorithm for nding a Fourier representation R of B terms for a given discrete signal A of leng...
Anna C. Gilbert, Sudipto Guha, Piotr Indyk, S. Mut...