2125 search results - page 231 / 425 » On Graph Complexity |
130
Voted
UAI
2008
15 years 5 months ago
2008
The paper introduces a generalization for known probabilistic models such as log-linear and graphical models, called here multiplicative models. These models, that express probabi...
120
Voted
ICVGIP
2004
15 years 4 months ago
2004
Automatic content based schemes, as opposed to those with human endeavor, have become important as users attempt to organize massive data presented in the form of multimedia data ...
129
Voted
MASCOTS
2003
15 years 4 months ago
2003
Scalability is the primary challenge to studying large complex network systems with network emulation. This paper studies topology partitioning, assigning disjoint pieces of the n...
108
Voted
FSTTCS
2008
Springer
15 years 4 months ago
2008
Springer
An average-time game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by ...
133
Voted
APAL
2008
15 years 3 months ago
2008
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead ...