1942 search results - page 110 / 389 » Speeding Up XTR |
176
click to vote
BTW
1999
Springer
15 years 10 months ago
1999
Springer
Abstract: Spatial data mining algorithms heavily depend on the efficient processing of neighborhood relations since the neighbors of many objects have to be investigated in a singl...
178
click to vote
PLDI
1994
ACM
15 years 10 months ago
1994
ACM
In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single entry single exit (SESE) regions of the control flo...
191
click to vote
DEBS
2009
ACM
15 years 10 months ago
2009
ACM
One of the main challenges faced by content-based publish/subscribe systems is handling large amount of dynamic subscriptions and publications in a multidimensional content space....
189
click to vote
ANNPR
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Decomposition techniques are used to speed up training support vector machines but for linear programming support vector machines (LP-SVMs) direct implementation of decom...
170
click to vote
DASFAA
2004
IEEE
15 years 10 months ago
2004
IEEE
Abstract. Data declustering speeds up large data set retrieval by partitioning the data across multiple disks or sites and performing retrievals in parallel. Performance is determi...