Sciweavers

4639 search results - page 90 / 928
» A General Method for Errors-in-Variables Problems in Compute...
Sort
View
AAAI
2010
13 years 6 months ago
Latent Class Models for Algorithm Portfolio Methods
Different solvers for computationally difficult problems such as satisfiability (SAT) perform best on different instances. Algorithm portfolios exploit this phenomenon by predicti...
Bryan Silverthorn, Risto Miikkulainen
PAMI
2008
198views more  PAMI 2008»
13 years 8 months ago
A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors
Among the most exciting advances in early vision has been the development of efficient energy minimization algorithms for pixel-labeling tasks such as depth or texture computation....
Richard Szeliski, Ramin Zabih, Daniel Scharstein, ...
ISCAS
1994
IEEE
131views Hardware» more  ISCAS 1994»
14 years 28 days ago
An Efficient Design Method for Optimal Weighted Median Filtering
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
Ruikang Yang, Moncef Gabbouj, Yrjö Neuvo
PODS
2007
ACM
159views Database» more  PODS 2007»
14 years 9 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
ICCV
2005
IEEE
14 years 2 months ago
How Hard is 3-View Triangulation Really?
We present a solution for optimal triangulation in three views. The solution is guaranteed to find the optimal solution because it computes all the stationary points of the (maxi...
Henrik Stewénius, Frederik Schaffalitzky, D...