14518 search results - page 130 / 2904 » Two Problems for Sophistication |
CINQ
2004
Springer
14 years 3 months ago
2004
Springer
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
COMPLIFE
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. This paper presents a method that uses gene ontologies, together with the paradigm of relational subgroup discovery, to help find description of groups of genes different...
SODA
1996
ACM
13 years 11 months ago
1996
ACM
The Maximum Agreement Subtree problem is the following: given two rooted trees whose leaves are drawn from the same set of items (e.g., species), find the largest subset of these i...
MANSCI
2006
13 years 10 months ago
2006
This paper presents a new information acquisition problem motivated by business applications where customer data has to be acquired with a specific modeling objective in mind. In ...
ICCSA
2003
Springer
14 years 3 months ago
2003
Springer
In this paper we study the problems of separability of two disjoint point sets in 3D by multiple criteria extending some notions on separability of two disjoint point sets in the ...