Sciweavers

1909 search results - page 173 / 382
» Generalized Filtering Decomposition
Sort
View
EJC
2010
15 years 3 months ago
Partitions versus sets: A case of duality
In a recent paper, Amini et al. introduced a general framework to prove duality theorems between tree decompositions and their dual combinatorial object. They unify all known ad-h...
Laurent Lyaudet, Frédéric Mazoit, St...
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
15 years 5 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
ATAL
2011
Springer
14 years 3 months ago
Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
Manish Jain, Christopher Kiekintveld, Milind Tambe

Lecture Notes
488views
17 years 2 months ago
Econometrics
These notes cover several topics such as Univariate Time Series Analysis, The Distribution of a Sample Average, Least Squares, Instrumental Variable Method, Simulating the Finite S...
Paul Söderlind
ICPR
2002
IEEE
16 years 4 months ago
On the Equivalence of Local-Mode Finding, Robust Estimation and Mean-Shift Analysis as Used in Early Vision Tasks
In this paper we show the equivalence of three techniques used in image processing: local-mode finding, robust-estimation and mean-shift analysis. The computational common element...
Rein van den Boomgaard, Joost van de Weijer