419 search results - page 41 / 84 » Succincter |
115
click to vote
JCT
2007
15 years 5 months ago
2007
In two previous papers, the study of partitions with short sequences has been developed both for its intrinsic interest and for a variety of applications. The object of this paper...
147
click to vote
SAGT
2010
Springer
15 years 3 months ago
2010
Springer
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...
135
click to vote
EMNLP
2009
15 years 2 months ago
2009
Randomised techniques allow very big language models to be represented succinctly. However, being batch-based they are unsuitable for modelling an unbounded stream of language whi...
173
click to vote
ICMLA
2009
15 years 2 months ago
2009
Languages that combine predicate logic with probabilities are needed to succinctly represent knowledge in many real-world domains. We consider a formalism based on universally qua...
161
click to vote
MST
2011
15 years 2 days ago
2011
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...