503 search results - page 85 / 101 » Probabilistic Weighted Automata |
CVPR
2000
IEEE
14 years 10 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...
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
Identification of those genes that might anticipate the clinical behavior of different types of cancers is challenging due to availability of a smaller number of patient samples...
SIGIR
2008
ACM
13 years 8 months ago
2008
ACM
It is difficult to apply machine learning to new domains because often we lack labeled problem instances. In this paper, we provide a solution to this problem that leverages domai...
ATAL
2009
Springer
14 years 3 months ago
2009
Springer
This paper presents a framework for describing the spatial distribution and the global frequency of agents who play the spatial prisoner’s dilemma with coalition formation. The ...
EUROCRYPT
2004
Springer
14 years 2 months ago
2004
Springer
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...