3946 search results - page 496 / 790 » The computational complexity of choice sets |
195
click to vote
AAAI
2006
15 years 8 months ago
2006
We examine a setting in which a buyer wishes to purchase probabilistic information from some agent. The seller must invest effort in order to gain access to the information, and m...
171
click to vote
ACL
2006
15 years 8 months ago
2006
Synchronous Context-Free Grammars (SCFGs) have been successfully exploited as translation models in machine translation applications. When parsing with an SCFG, computational comp...
174
click to vote
GRAPHICSINTERFACE
2001
15 years 8 months ago
2001
We introduce a set of techniques that are used together to produce realistic-looking animations of burning objects. These include a new method for simulating spreading on polygona...
167
click to vote
NIPS
2001
15 years 8 months ago
2001
Unsupervised learning algorithms have been derived for several statistical models of English grammar, but their computational complexity makes applying them to large data sets int...
154
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...