Sciweavers

1380 search results - page 105 / 276
» A General Polynomial Sieve
Sort
View
95
Voted
STOC
2010
ACM
168views Algorithms» more  STOC 2010»
15 years 10 months ago
Non-commutative circuits and the sum-of-squares problem
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
Pavel Hrubes, Avi Wigderson and Amir Yehudayoff
109
Voted
CSL
2010
Springer
15 years 2 months ago
Fibrational Induction Rules for Initial Algebras
This paper provides an induction rule that can be used to prove properties of data structures whose types are inductive, i.e., are carriers of initial algebras of functors. Our res...
Neil Ghani, Patricia Johann, Clément Fumex
167
Voted
STOC
2012
ACM
225views Algorithms» more  STOC 2012»
13 years 3 months ago
An algorithmic characterization of multi-dimensional mechanisms
We obtain a characterization of feasible, Bayesian, multi-item multi-bidder mechanisms with independent, additive bidders as distributions over hierarchical mechanisms. Combined w...
Yang Cai, Constantinos Daskalakis, S. Matthew Wein...
106
Voted
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
16 years 1 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...
106
Voted
GLOBECOM
2009
IEEE
15 years 7 months ago
Feasibility Conditions for Interference Alignment
—The degrees of freedom (DoF) of K-user MIMO interference networks with constant channel coefficients are not known in general. Determining the feasibility of a linear interfere...
Cenk M. Yetis, Tiangao Gou, Syed Ali Jafar, Ahmet ...