Sciweavers

923 search results - page 159 / 185
» The Computational Structure of Progress Conditions
Sort
View
ICDE
2002
IEEE
106views Database» more  ICDE 2002»
15 years 11 months ago
OSSM: A Segmentation Approach to Optimize Frequency Counting
Computing the frequency of a pattern is one of the key operations in data mining algorithms. We describe a simple yet powerful way of speeding up any form of frequency counting sa...
Carson Kai-Sang Leung, Raymond T. Ng, Heikki Manni...
ICML
2006
IEEE
15 years 10 months ago
Learning hierarchical task networks by observation
Knowledge-based planning methods offer benefits over classical techniques, but they are time consuming and costly to construct. There has been research on learning plan knowledge ...
Negin Nejati, Pat Langley, Tolga Könik
EVOW
2010
Springer
15 years 4 months ago
Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive
Genetic algorithms (GAs) share a common weakness with most other metaheuristics: Candidate solutions are in general revisited multiple times, lowering diversity and wasting preciou...
Günther R. Raidl, Bin Hu
76
Voted
ICASSP
2009
IEEE
15 years 4 months ago
Shrinkage estimation of high dimensional covariance matrices
We address covariance estimation under mean-squared loss in the Gaussian setting. Specifically, we consider shrinkage methods which are suitable for high dimensional problems wit...
Yilun Chen, Ami Wiesel, Alfred O. Hero
CDC
2008
IEEE
125views Control Systems» more  CDC 2008»
15 years 4 months ago
Continuous motion planning for information forecast
— This paper addresses planning of continuous paths for mobile sensors to improve long-term forecast performance. With the information gain defined by the mutual information bet...
Han-Lim Choi, Jonathan P. How