Sciweavers

17688 search results - page 298 / 3538
» Data Set Balancing
Sort
View
GBRPR
2005
Springer
16 years 4 days ago
Approximating the Problem, not the Solution: An Alternative View of Point Set Matching
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
Tibério S. Caetano, Terry Caelli
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
15 years 12 months ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
ICLP
1999
Springer
15 years 11 months ago
CLAIRE: Combining Sets, Search, and Rules to Better Express Algorithms
This paper presents a programming language that includes paradigms that are usually associated with declarative languages, such as sets, rules and search, into an imperative (funct...
Yves Caseau, François-Xavier Josset, Fran&c...
ADBIS
2009
Springer
162views Database» more  ADBIS 2009»
15 years 10 months ago
Efficient Set Similarity Joins Using Min-prefixes
Identification of all objects in a dataset whose similarity is not less than a specified threshold is of major importance for management, search, and analysis of data. Set similari...
Leonardo Ribeiro, Theo Härder
ISMIS
2000
Springer
15 years 10 months ago
Design of Rough Neurons: Rough Set Foundation and Petri Net Model
This paper introduces the design of rough neurons based on rough sets. Rough neurons instantiate approximate reasoning in assessing knowledge gleaned from input data. Each neuron c...
James F. Peters, Andrzej Skowron, Zbigniew Suraj, ...