Sciweavers

4486 search results - page 97 / 898
» Adaptable Boundary Sets
Sort
View
SMI
2006
IEEE
108views Image Analysis» more  SMI 2006»
15 years 10 months ago
Segmenting Point Sets
There is a growing need to extract features from point sets for purposes like model classification, matching, and exploration. We introduce a technique for segmenting a point-sam...
Ichitaro Yamazaki, Vijay Natarajan, Zhaojun Bai, B...
COCOON
2003
Springer
15 years 9 months ago
Finding Hidden Independent Sets in Interval Graphs
We design efficient competitive algorithms for discovering hidden information using few queries. Specifically, consider a game in a given set of intervals (and their implied inte...
Therese C. Biedl, Brona Brejová, Erik D. De...
EWCBR
2006
Springer
15 years 8 months ago
Rough Set Feature Selection Algorithms for Textual Case-Based Classification
Feature selection algorithms can reduce the high dimensionality of textual cases and increase case-based task performance. However, conventional algorithms (e.g., information gain)...
Kalyan Moy Gupta, David W. Aha, Philip Moore
GECCO
2006
Springer
186views Optimization» more  GECCO 2006»
15 years 8 months ago
Genetic algorithms for action set selection across domains: a demonstration
Action set selection in Markov Decision Processes (MDPs) is an area of research that has received little attention. On the other hand, the set of actions available to an MDP agent...
Greg Lee, Vadim Bulitko
SIAMJO
2010
74views more  SIAMJO 2010»
14 years 11 months ago
Various Lipschitz-like Properties for Functions and Sets I: Directional Derivative and Tangential Characterizations
In this work we introduce for extended real valued functions, defined on a Banach space X, the concept of K directionally Lipschitzian behavior, where K is a bounded subset of X. F...
Rafael Correa, Pedro Gajardo, Lionel Thibault