Sciweavers

2610 search results - page 268 / 522
» Computational Probabilistic Non-interference
Sort
View
CG
2006
Springer
15 years 7 months ago
A Retrograde Approximation Algorithm for One-Player Can't Stop
Abstract. A one-player, finite, probabilistic game with perfect information can be presented as a bipartite graph. For one-player Can't Stop, the graph is cyclic and the chall...
James Glenn, Haw-ren Fang, Clyde P. Kruskal
116
Voted
ACL
2010
15 years 2 months ago
How Many Words Is a Picture Worth? Automatic Caption Generation for News Images
In this paper we tackle the problem of automatic caption generation for news images. Our approach leverages the vast resource of pictures available on the web and the fact that ma...
Yansong Feng, Mirella Lapata
ACL
2010
15 years 2 months ago
Word Alignment with Synonym Regularization
We present a novel framework for word alignment that incorporates synonym knowledge collected from monolingual linguistic resources in a bilingual probabilistic model. Synonym inf...
Hiroyuki Shindo, Akinori Fujino, Masaaki Nagata
AIPS
2008
15 years 6 months ago
Stochastic Enforced Hill-Climbing
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
Jia-Hong Wu, Rajesh Kalyanam, Robert Givan
ENTCS
2008
91views more  ENTCS 2008»
15 years 4 months ago
Expressing Priorities and External Probabilities in Process Algebra via Mixed Open/Closed Systems
Defining operational semantics for a process algebra is often based either on labeled transition systems that account for interaction with a context or on the so-called reduction ...
Mario Bravetti