Sciweavers

127 search results - page 19 / 26
» Computational Complexity of Some Problems Involving Congruen...
Sort
View
CORR
2012
Springer
249views Education» more  CORR 2012»
12 years 3 months ago
Controlling Candidate-Sequential Elections
All previous work on “candidate-control” manipulation of elections has been in the model of full-information, simultaneous voting. This is a problem, since in quite a few real...
Edith Hemaspaandra, Lane A. Hemaspaandra, Jör...
FOCS
1998
IEEE
13 years 11 months ago
Quantum Lower Bounds by Polynomials
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
Robert Beals, Harry Buhrman, Richard Cleve, Michel...
IPPS
2002
IEEE
14 years 13 days ago
Achieving Scalability in Parallel Tabled Logic Programs
Tabling or memoing is a technique where one stores intermediate answers to a problem so that they can be reused in further calls. Tabling is of interest to logic programming becau...
Ricardo Rocha, Fernando M. A. Silva, Vítor ...
AICCSA
2005
IEEE
113views Hardware» more  AICCSA 2005»
13 years 9 months ago
Towards autonomic Web services
Autonomic Computing was introduced to reduce the complexity of managing computing systems; however, the heterogeneous nature existing in most computing systems introduces some dif...
Amir Zeid, Sherif A. Gurguis
ICML
2010
IEEE
13 years 8 months ago
Learning Efficiently with Approximate Inference via Dual Losses
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
Ofer Meshi, David Sontag, Tommi Jaakkola, Amir Glo...