1048 search results - page 143 / 210 » Best Probabilistic Transformers |
231
click to vote
APVIS
2011
14 years 6 months ago
2011
NETSPEAK helps writers in choosing words while writing a text. It checks for the commonness of phrases and allows for the retrieval of alternatives by means of wildcard queries. T...
181
click to vote
AAAI
2012
13 years 8 months ago
2012
For interaction with its environment, a robot is required to learn models of objects and to perceive these models in the livestreams from its sensors. In this paper, we propose a ...
176
click to vote
CVPR
2000
IEEE
16 years 8 months ago
2000
IEEE
In Proc. of IEEE Conf. on CVPR'2000, Vol.I, pp.222-227, Hilton Head Island, SC, 2000 In many vision applications, the practice of supervised learning faces several difficulti...
183
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
Copyright 2004 IEEE. Published in Conference on Computer Vision and Pattern Recognition (CVPR-2004), June 27 - July 2, 2004, Washington DC. Personal use of this material is permit...
180
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...