Sciweavers

16404 search results - page 852 / 3281
» A set coverage problem
Sort
View
DMIN
2006
132views Data Mining» more  DMIN 2006»
15 years 9 months ago
Discovering Accurate and Interesting Classification Rules Using Genetic Algorithm
Discovering accurate and interesting classification rules is a significant task in the post-processing stage of a data mining (DM) process. Therefore, an optimization problem exis...
Janaki Gopalan, Reda Alhajj, Ken Barker
SODA
2001
ACM
105views Algorithms» more  SODA 2001»
15 years 9 months ago
Online point location in planar arrangements and its applications
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
Sariel Har-Peled, Micha Sharir
ATVA
2010
Springer
125views Hardware» more  ATVA 2010»
15 years 8 months ago
Using Redundant Constraints for Refinement
Abstract. This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid...
Eugene Asarin, Thao Dang, Oded Maler, Romain Testy...
DCG
2008
93views more  DCG 2008»
15 years 7 months ago
Robust Shape Fitting via Peeling and Grating Coresets
Let P be a set of n points in Rd . A subset S of P is called a (k, )-kernel if for every direction, the direction width of S -approximates that of P, when k "outliers" c...
Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu
IJFCS
2006
77views more  IJFCS 2006»
15 years 7 months ago
Spike Trains in Spiking Neural P Systems
We continue here the study of the recently introduced spiking neural P systems, which mimic the way that neurons communicate with each other by means of short electrical impulses, ...
Gheorghe Paun, Mario J. Pérez-Jiméne...