Sciweavers

1236 search results - page 24 / 248
» On the Hamkins approximation property
Sort
View
STOC
2003
ACM
140views Algorithms» more  STOC 2003»
14 years 11 months ago
Approximation schemes for clustering problems
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
Wenceslas Fernandez de la Vega, Marek Karpinski, C...
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
14 years 5 months ago
Approximating geometric crossover in semantic space
We propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program’s eval...
Krzysztof Krawiec, Pawel Lichocki
CVPR
2011
IEEE
13 years 7 months ago
Learning Message-Passing Inference Machines for Structured Prediction
Nearly every structured prediction problem in computer vision requires approximate inference due to large and complex dependencies among output labels. While graphical models prov...
Stephane Ross, Daniel Munoz, J. Andrew Bagnell
ENTCS
2006
134views more  ENTCS 2006»
13 years 11 months ago
Computing Over-Approximations with Bounded Model Checking
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
Daniel Kroening
ISMIS
2005
Springer
14 years 4 months ago
Subsystem Based Generalizations of Rough Set Approximations
Abstract. Subsystem based generalizations of rough set approximations are investigated. Instead of using an equivalence relation, an arbitrary binary relation is used to construct ...
Yiyu Yao, Yaohua Chen