690 search results - page 108 / 138 » Dense Admissible Sets |
126
click to vote
SMA
2005
ACM
15 years 7 months ago
2005
ACM
We propose a fast and robust method for detecting crest lines on surfaces approximated by dense triangle meshes. The crest lines, salient surface features defined via first- and...
107
click to vote
ESA
2005
Springer
15 years 7 months ago
2005
Springer
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
128
click to vote
PCI
2005
Springer
15 years 7 months ago
2005
Springer
Cache misses form a major bottleneck for memory-intensive applications, due to the significant latency of main memory accesses. Loop tiling, in conjunction with other program tran...
121
click to vote
SAC
2004
ACM
15 years 7 months ago
2004
ACM
Most of the complexity of common data mining tasks is due to the unknown amount of information contained in the data being mined. The more patterns and correlations are contained ...
DAWAK
2004
Springer
15 years 7 months ago
2004
Springer
All methods of association rule mining require the frequent sets of items, that occur together sufficiently often to be the basis of potentially interesting rules, to be first com...