3946 search results - page 364 / 790 » The computational complexity of choice sets |
187
click to vote
IANDC
2006
15 years 6 months ago
2006
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
221
click to vote
IS
2008
15 years 6 months ago
2008
In this paper we propose DFL -- a formal, graphical workflow language for dataflows, i.e., workflows where large amounts of complex data are manipulated, and the structure of the ...
210
click to vote
CG
1998
Springer
15 years 6 months ago
1998
Springer
We are investigating techniques for providing smooth transitions when simplifying large, static geometric models with texture-based representations (or impostors). Traditionally, ...
216
click to vote
NAACL
2010
15 years 4 months ago
2010
We present three approaches for unsupervised grammar induction that are sensitive to data complexity and apply them to Klein and Manning's Dependency Model with Valence. The ...
262
click to vote
CVPR
2011
IEEE
15 years 2 months ago
2011
IEEE
In this paper we introduce visual phrases, complex visual composites like “a person riding a horse”. Visual phrases often display significantly reduced visual complexity comp...