2883 search results - page 219 / 577 » Algorithms for merged indexes |
158
click to vote
APIN
2007
15 years 6 months ago
2007
In this thesis, we describe a genetic algorithm for optimizing the superpeer structure of semantic peer to peer networks. Peer to peer, also called P2P, networks enable us to sear...
168
click to vote
JUCS
2002
15 years 6 months ago
2002
: In a database with categorical attributes, each attribute defines a partition whose classes can be regarded as natural clusters of rows. In this paper we focus on finding a parti...
183
click to vote
ICML
1998
IEEE
16 years 7 months ago
1998
IEEE
In this work, we present a new bottom-up algorithmfor decision tree pruning that is very e cient requiring only a single pass through the given tree, and prove a strong performanc...
168
click to vote
VLDB
2005
ACM
15 years 12 months ago
2005
ACM
This paper addresses the efficient processing of top-k queries in wide-area distributed data repositories where the index lists for the attribute values (or text terms) of a query...
153
click to vote
ICAIL
2003
ACM
15 years 11 months ago
2003
ACM
Name matching—recognizing when two different strings are likely to denote the same entity—is an important task in many legal information systems, such as case-management syste...