Sciweavers

3365 search results - page 71 / 673
» Multidimensional Data Modeling for Complex Data
Sort
View
IPPS
2006
IEEE
15 years 8 months ago
An extensible global address space framework with decoupled task and data abstractions
ions Sriram Krishnamoorthy½ Umit Catalyurek¾ Jarek Nieplocha¿ Atanas Rountev½ P. Sadayappan½ ½ Dept. of Computer Science and Engineering, ¾ Dept. of Biomedical Informatics T...
Sriram Krishnamoorthy, Ümit V. Çataly&...
249
Voted
DNA
2011
Springer
213views Bioinformatics» more  DNA 2011»
14 years 2 months ago
Graph-Theoretic Formalization of Hybridization in DNA Sticker Complexes
Sticker complexes are a a formal graph-based data model for a restricted class of DNA complexes, motivated by potential applications to databases. This data model allows for a pure...
Robert Brijder, Joris J. M. Gillis, Jan Van den Bu...
121
Voted
DAC
2003
ACM
16 years 3 months ago
A complexity effective communication model for behavioral modeling of signal processing applications
In this paper, we argue that the address space of memory regions that participate in inter task communication is over-specified by the traditional communication models used in beh...
M. N. V. Satya Kiran, M. N. Jayram, Pradeep Rao, S...
213
Voted
SIGMOD
2008
ACM
193views Database» more  SIGMOD 2008»
16 years 2 months ago
ARCube: supporting ranking aggregate queries in partially materialized data cubes
Supporting ranking queries in database systems has been a popular research topic recently. However, there is a lack of study on supporting ranking queries in data warehouses where...
Tianyi Wu, Dong Xin, Jiawei Han
ICPP
2000
IEEE
15 years 6 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary