3223 search results - page 522 / 645 » The Scaling of Search Cost |
DEXA
2005
Springer
14 years 1 months ago
2005
Springer
The main challenge of mining sequential patterns is the high processing cost of support counting for large amount of candidate patterns. For solving this problem, SPAM algorithm wa...
EPIA
2005
Springer
14 years 1 months ago
2005
Springer
This paper presents an adaptation of the peepholing method to regression trees. Peepholing was described as a means to overcome the major computational bottleneck of growing classi...
PCI
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Given two datasets DA and DB the closest-pair query (CPQ) retrieves the pair (a,b), where a ∈ DA and b ∈ DB, having the smallest distance between all pairs of objects...
SAC
2004
ACM
14 years 1 months ago
2004
ACM
Some telecommunication systems can not afford the cost of repeating a corrupted message. Instead, the message should be somewhat “corrected” by the receiver. In these cases a...
SAC
2004
ACM
14 years 1 months ago
2004
ACM
It is increasingly important to optimally select base stations in the design of cellular networks, as customers demand cheaper and better wireless services. From a set of potentia...