Sciweavers

1236 search results - page 62 / 248
» On the Hamkins approximation property
Sort
View
85
Voted
ICDM
2005
IEEE
165views Data Mining» more  ICDM 2005»
15 years 6 months ago
Optimizing Constraint-Based Mining by Automatically Relaxing Constraints
In constraint-based mining, the monotone and antimonotone properties are exploited to reduce the search space. Even if a constraint has not such suitable properties, existing algo...
Arnaud Soulet, Bruno Crémilleux
108
Voted
COCO
1995
Springer
113views Algorithms» more  COCO 1995»
15 years 4 months ago
On the Structure of Low Sets
Over a decade ago, Schoning introduced the concept of lowness into structural complexity theory. Since then a large body of results has been obtained classifying various complexit...
Johannes Köbler
200
Voted
ICDT
2009
ACM
148views Database» more  ICDT 2009»
16 years 1 months ago
Tight results for clustering and summarizing data streams
In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...
Sudipto Guha
SOFSEM
2010
Springer
15 years 9 months ago
On the Complexity of the Highway Pricing Problem
Abstract. The highway pricing problem asks for prices to be determined for segments of a single highway such as to maximize the revenue obtainable from a given set of customers wit...
Alexander Grigoriev, Joyce van Loon, Marc Uetz
94
Voted
IJCNN
2000
IEEE
15 years 5 months ago
An Incremental Growing Neural Network and its Application to Robot Control
This paper describes a novel network model, which is able to control its growth on the basis of the approximation requests. Two classes of self-tuning neural models are considered...
A. Carlevarino, R. Martinotti, Giorgio Metta, Giul...