Sciweavers

7930 search results - page 379 / 1586
» Greedy in Approximation Algorithms
Sort
View
CAD
2008
Springer
15 years 6 months ago
Detecting approximate symmetries of discrete point subsets
Detecting approximate symmetries of parts of a model is important when attempting to determine the geometric design intent of approximate boundary-representation (B-rep) solid mod...
Ming Li, Frank C. Langbein, Ralph R. Martin
CORR
2010
Springer
170views Education» more  CORR 2010»
15 years 6 months ago
Global Optimization for Value Function Approximation
Existing value function approximation methods have been successfully used in many applications, but they often lack useful a priori error bounds. We propose a new approximate bili...
Marek Petrik, Shlomo Zilberstein
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 6 months ago
Approximated Structured Prediction for Learning Large Scale Graphical Models
In this paper we propose an approximated structured prediction framework for large scale graphical models and derive message-passing algorithms for learning their parameters effic...
Tamir Hazan, Raquel Urtasun
ECCC
2000
93views more  ECCC 2000»
15 years 6 months ago
Improved Approximation of MAX-CUT on Graphs of Bounded Degree
We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
Uriel Feige, Marek Karpinski, Michael Langberg
WINE
2009
Springer
138views Economy» more  WINE 2009»
16 years 1 months ago
Covering Games: Approximation through Non-cooperation
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
Martin Gairing