845 search results - page 156 / 169 » Complexity Dimensions and Learnability |
203
click to vote
AIIA
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. A clustering method is presented which can be applied to relational knowledge bases. It can be used to discover interesting groupings of resources through their (semantic...
201
click to vote
DAWAK
2007
Springer
16 years 18 days ago
2007
Springer
Several business applications such as marketing basket analysis, clickstream analysis, fraud detection and churning migration analysis demand gradient data analysis. By employing g...
151
click to vote
IWMM
2007
Springer
16 years 17 days ago
2007
Springer
This article presents a heap space analysis for (sequential) Java bytecode. The analysis generates heap space cost relations which define at compile-time the heap consumption of ...
172
click to vote
ICPP
2006
IEEE
16 years 14 days ago
2006
IEEE
Space filling curves (SFCs) are widely used for parallel domain decomposition in scientific computing applications. The proximity preserving properties of SFCs are expected to k...
197
Voted
INFOCOM
2006
IEEE
16 years 14 days ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...