Sciweavers

64 search results - page 8 / 13
» Monotone circuits for monotone weighted threshold functions
Sort
View
STOC
2007
ACM
98views Algorithms» more  STOC 2007»
14 years 8 months ago
Negative weights make adversaries stronger
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
Peter Høyer, Troy Lee, Robert Spalek
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
14 years 1 months ago
A new strategy for querying priced information
This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...
Ferdinando Cicalese, Eduardo Sany Laber
GLVLSI
2003
IEEE
145views VLSI» more  GLVLSI 2003»
14 years 29 days ago
Using dynamic domino circuits in self-timed systems
We introduce a simple hierarchical design technique for using dynamic domino circuits to build high-performance self-timed data path circuits. We wrap the dynamic domino circuit i...
Jung-Lin Yang, Erik Brunvand
ICCSA
2007
Springer
14 years 1 months ago
On Optimization of the Importance Weighted OWA Aggregation of Multiple Criteria
The problem of aggregating multiple numerical criteria to form overall objective functions is of considerable importance in many disciplines. The ordered weighted averaging (OWA) a...
Wlodzimierz Ogryczak, Tomasz Sliwinski
SIAMCOMP
2000
109views more  SIAMCOMP 2000»
13 years 7 months ago
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, K...