Sciweavers

258 search results - page 15 / 52
» Weak Bisimulation Approximants
Sort
View
IJCAI
2007
15 years 1 months ago
Iterated Weaker-than-Weak Dominance
We introduce a weakening of standard gametheoretic dominance conditions, called δdominance, which enables more aggressive pruning of candidate strategies at the cost of solution ...
Shih-Fen Cheng, Michael P. Wellman
ACTA
2010
87views more  ACTA 2010»
14 years 12 months ago
On the observational theory of the CPS-calculus
We study the observational theory of Thielecke's CPS-calculus, a distillation of the target language of Continuation-Passing Style transforms. We define a labelled transition...
Massimo Merro
ECCV
2008
Springer
16 years 1 months ago
Hamming Embedding and Weak Geometric Consistency for Large Scale Image Search
This paper improves recent methods for large scale image search. State-of-the-art methods build on the bag-of-features image representation. We, first, analyze bag-of-features in t...
Herve Jegou, Matthijs Douze, Cordelia Schmid
APPML
2005
99views more  APPML 2005»
14 years 11 months ago
A numerical study of iterative refinement schemes for weakly singular integral equations
Three iterative refinement schemes are studied for approximating the solutions of linear weakly singular Fredholm integral equations of the second kind. The rates of convergence a...
Filomena D. d'Almeida, Olivier Titaud, Paulo B. Va...
CDC
2008
IEEE
144views Control Systems» more  CDC 2008»
15 years 1 months ago
Controllability decompositions of networked systems through quotient graphs
In this paper we study decentralized, networked systems whose interaction dynamics are given by a nearestneighbor averaging rule. By letting one node in the network take on the rol...
Simone Martini, Magnus Egerstedt, Antonio Bicchi