53 search results - page 7 / 11 » On the Size of Monotone Span Programs |
ICALP
2000
Springer
15 years 1 months ago
2000
Springer
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 partial transve...
86
Voted
SIGSOFT
2007
ACM
15 years 10 months ago
2007
ACM
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
ASIACRYPT
2008
Springer
14 years 11 months ago
2008
Springer
Strongly multiplicative linear secret sharing schemes (LSSS) have been a powerful tool for constructing secure multi-party computation protocols. However, it remains open whether o...
NIPS
2008
14 years 11 months ago
2008
We propose a new class of consistency constraints for Linear Programming (LP) relaxations for finding the most probable (MAP) configuration in graphical models. Usual cluster-base...