Sciweavers

138 search results - page 8 / 28
» On proximity oblivious testing
Sort
View
ISTCS
1995
Springer
15 years 1 months ago
Some Improvements to Total Degree Tests
A low-degree test is a collection of simple, local rules for checking the proximity of an arbitrary function to a lowdegree polynomial. Each rule depends on the function’s value...
Katalin Friedl, Madhu Sudan
APPROX
2009
Springer
85views Algorithms» more  APPROX 2009»
15 years 4 months ago
Algorithmic Aspects of Property Testing in the Dense Graphs Model
In this paper we consider two basic questions regarding the query complexity of testing graph properties in the adjacency matrix model. The first question refers to the relation ...
Oded Goldreich, Dana Ron
FLAIRS
2009
14 years 7 months ago
Unit Testing for Qualitative Spatial and Temporal Reasoning
Researchers in commonsense, qualitative spatial and temporal reasoning (QSTR) provide flexible and intuitive methods for reasoning about vague and uncertain information including ...
Carl P. L. Schultz, Robert Amor, Hans W. Guesgen
IJISTA
2008
95views more  IJISTA 2008»
14 years 9 months ago
Mining manufacturing data using genetic algorithm-based feature set decomposition
Data mining methods can be used for discovering interesting patterns in manufacturing databases. These patterns can be used to improve manufacturing processes. However, data accum...
Lior Rokach
PR
2008
93views more  PR 2008»
14 years 9 months ago
Genetic algorithm-based feature set partitioning for classification problems
Feature set partitioning generalizes the task of feature selection by partitioning the feature set into subsets of features that are collectively useful, rather than by finding a ...
Lior Rokach