Sciweavers

1974 search results - page 186 / 395
» On Unbiased Linear Approximations
Sort
View
PODS
2011
ACM
220views Database» more  PODS 2011»
14 years 9 months ago
Maximizing conjunctive views in deletion propagation
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...
Benny Kimelfeld, Jan Vondrák, Ryan Williams
SPAA
2004
ACM
16 years 3 days ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
JAIR
2008
113views more  JAIR 2008»
15 years 6 months ago
Graphical Model Inference in Optimal Control of Stochastic Multi-Agent Systems
In this article we consider the issue of optimal control in collaborative multi-agent systems with stochastic dynamics. The agents have a joint task in which they have to reach a ...
Bart van den Broek, Wim Wiegerinck, Bert Kappen
WINE
2009
Springer
171views Economy» more  WINE 2009»
16 years 1 months ago
The Impact of Social Ignorance on Weighted Congestion Games
We consider weighted linear congestion games, and investigate how social ignorance, namely lack of information about the presence of some players, affects the inefficiency of pure...
Dimitris Fotakis, Vasilis Gkatzelis, Alexis C. Kap...
196
Voted
CVPR
2005
IEEE
16 years 8 months ago
Accurate and Efficient Stereo Processing by Semi-Global Matching and Mutual Information
This paper considers the objectives of accurate stereo matching, especially at object boundaries, robustness against recording or illumination changes and efficiency of the calcul...
Heiko Hirschmüller