1225 search results - page 24 / 245 » The Instance Complexity Conjecture |
COMPGEOM
2010
ACM
14 years 22 days ago
2010
ACM
We present two new fundamental lower bounds on the worst-case combinatorial complexity of sets of free lines and sets of maximal free line segments in the presence of balls in thr...
MFCS
2005
Springer
14 years 1 months ago
2005
Springer
We investigate the complexity of finding prime implicants and minimal equivalent DNFs for Boolean formulas, and of testing equivalence and isomorphism of monotone formulas. For DN...
HICSS
2003
IEEE
14 years 29 days ago
2003
IEEE
This paper1 provides a view of modeling the information dominance problem of military systems as representative of modeling other complex systems. The ideas are an extension of ea...
ECCC
2011
13 years 2 months ago
2011
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
COLT
2008
Springer
13 years 9 months ago
2008
Springer
We study the potential benefits to classification prediction that arise from having access to unlabeled samples. We compare learning in the semi-supervised model to the standard, ...