14779 search results - page 401 / 2956 » On Ultrametric Algorithmic Information |
166
click to vote
ISPD
1998
ACM
15 years 11 months ago
1998
ACM
We propose a simple, isometry invariant pattern matching algorithm for an effective data reduction useful in layout-related data processing of very complex IC designs. The repeata...
181
click to vote
KDD
1998
ACM
15 years 11 months ago
1998
ACM
Direct marketing response models seek to identify individuals most likely to respond to marketing solicitations. Such models are commonly evaluatedon classification accuracyand so...
160
click to vote
IPPS
1997
IEEE
15 years 11 months ago
1997
IEEE
The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we prop...
198
click to vote
APWEB
2008
Springer
15 years 8 months ago
2008
Springer
Resource searching in the current peer-to-peer (P2P) applications is mainly based on the keyword match. However, more and more P2P applications require an efficient semantic search...
192
click to vote
IADIS
2003
15 years 8 months ago
2003
The problem of hypertext classification deals with objects possessing more complex information structure than the plain text has. Present hypertext classification systems show the...