Sciweavers

1816 search results - page 193 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
ICML
2010
IEEE
15 years 7 months ago
From Transformation-Based Dimensionality Reduction to Feature Selection
Many learning applications are characterized by high dimensions. Usually not all of these dimensions are relevant and some are redundant. There are two main approaches to reduce d...
Mahdokht Masaeli, Glenn Fung, Jennifer G. Dy
NFM
2011
252views Formal Methods» more  NFM 2011»
15 years 1 months ago
Call Invariants
Program verifiers based on first-order theorem provers model the program heap as a collection of mutable maps. In such verifiers, preserving unmodified facts about the heap acr...
Shuvendu K. Lahiri, Shaz Qadeer
GECCO
2007
Springer
154views Optimization» more  GECCO 2007»
16 years 21 days ago
Cross entropy and adaptive variance scaling in continuous EDA
This paper deals with the adaptive variance scaling issue in continuous Estimation of Distribution Algorithms. A phenomenon is discovered that current adaptive variance scaling me...
Yunpeng Cai, Xiaomin Sun, Hua Xu, Peifa Jia
CPAIOR
2006
Springer
15 years 10 months ago
An Efficient Hybrid Strategy for Temporal Planning
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
Zhao Xing, Yixin Chen, Weixiong Zhang
VMV
2008
107views Visualization» more  VMV 2008»
15 years 8 months ago
Learning with Few Examples using a Constrained Gaussian Prior on Randomized Trees
Machine learning with few training examples always leads to over-fitting problems, whereas human individuals are often able to recognize difficult object categories from only one ...
Erik Rodner, Joachim Denzler