Sciweavers

1957 search results - page 126 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
ACIVS
2005
Springer
15 years 3 months ago
A Fast Sequential Rainfalling Watershed Segmentation Algorithm
Abstract. In this paper we present a new implementation of a rainfalling watershed segmentation algorithm. Our previous algorithm was a one-run algorithm. All the steps needed to c...
Johan de Bock, Patrick de Smet, Wilfried Philips
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
14 years 11 months ago
Deterministic Sampling Algorithms for Network Design
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
Anke van Zuylen
ISCI
1998
139views more  ISCI 1998»
14 years 9 months ago
A Rough Set Approach to Attribute Generalization in Data Mining
This paper presents a method for updating approximations of a concept incrementally. The results can be used to implement a quasi-incremental algorithm for learning classification...
Chien-Chung Chan
JAR
2008
81views more  JAR 2008»
14 years 10 months ago
Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints
Much research in the area of constraint processing has recently been focused on extracting small unsatisfiable "cores" from unsatisfiable constraint systems with the goal...
Mark H. Liffiton, Karem A. Sakallah
EDBT
2009
ACM
100views Database» more  EDBT 2009»
15 years 2 months ago
A view selection algorithm with performance guarantee
A view selection algorithm takes as input a fact table and computes a set of views to store in order to speed up queries. The performance of view selection algorithm is usually me...
Nicolas Hanusse, Sofian Maabout, Radu Tofan