530 search results - page 25 / 106 » Universal randomized switching |
112
click to vote
STOC
2005
ACM
16 years 2 months ago
2005
ACM
We prove exponential lower bounds for the refutation of a random 3-CNF with linear number of clauses by k-DNF Resolution for k log n/ log log n. For this we design a specially ta...
143
click to vote
SODA
2001
ACM
15 years 3 months ago
2001
ACM
Many massive graphs (such as the WWW graph and Call graphs) share certain universal characteristics which can be described by so-called the "power law". Here we determin...
120
click to vote
IJSI
2008
15 years 1 months ago
2008
Abstract In a line of recent development, probabilistic constructions of universal, homogeneous objects have been provided in various categories of ordered structures, such as caus...
164
click to vote
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
Much research effort on Automatic Image Annotation
(AIA) has been focused on Generative Model, due to its
well formed theory and competitive performance as compared
with many we...
164
click to vote
STOC
1994
ACM
15 years 6 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...