Sciweavers

845 search results - page 156 / 169
» Complexity Dimensions and Learnability
Sort
View
AIIA
2007
Springer
14 years 1 months ago
A Hierarchical Clustering Procedure for Semantically Annotated Resources
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...
Nicola Fanizzi, Claudia d'Amato, Floriana Esposito
DAWAK
2007
Springer
14 years 1 months ago
Mining Top-K Multidimensional Gradients
Several business applications such as marketing basket analysis, clickstream analysis, fraud detection and churning migration analysis demand gradient data analysis. By employing g...
Ronnie Alves, Orlando Belo, Joel Ribeiro
IWMM
2007
Springer
116views Hardware» more  IWMM 2007»
14 years 1 months ago
Heap space analysis for java bytecode
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 ...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
ICPP
2006
IEEE
14 years 1 months ago
A Formal Analysis of Space Filling Curves for Parallel Domain Decomposition
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...
Srikanta Tirthapura, Sudip Seal, Srinivas Aluru
INFOCOM
2006
IEEE
14 years 1 months ago
Theory and Network Applications of Dynamic Bloom Filters
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...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo