Sciweavers

580 search results - page 79 / 116
» Approximation Algorithms for Temporal Reasoning
Sort
View
ECCV
2010
Springer
15 years 7 months ago
Energy Minimization Under Constraints on Label Counts
Abstract. Many computer vision problems such as object segmentation or reconstruction can be formulated in terms of labeling a set of pixels or voxels. In certain scenarios, we may...
RSCTC
2000
Springer
126views Fuzzy Logic» more  RSCTC 2000»
15 years 6 months ago
Evolutionary Parsing for a Probabilistic Context Free Grammar
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
Lourdes Araujo
CEC
2008
IEEE
15 years 9 months ago
DEACO: Hybrid Ant Colony Optimization with Differential Evolution
—Ant Colony Optimization (ACO) algorithm is a novel meta-heuristic algorithm for the approximate solution of combinatorial optimization problems that has been inspired by the for...
Xiangyin Zhang, Haibin Duan, Jiqiang Jin
ICTAI
2007
IEEE
15 years 8 months ago
Conceptual Clustering Categorical Data with Uncertainty
Many real datasets have uncertain categorical attribute values that are only approximately measured or imputed. Uncertainty in categorical data is commonplace in many applications...
Yuni Xia, Bowei Xi
116
Voted
AAAI
2007
15 years 4 months ago
Unscented Message Passing for Arbitrary Continuous Variables in Bayesian Networks
Since Bayesian network (BN) was introduced in the field of artificial intelligence in 1980s, a number of inference algorithms have been developed for probabilistic reasoning. Ho...
Wei Sun, Kuo-Chu Chang