Sciweavers

9209 search results - page 34 / 1842
» Data Space Randomization
Sort
View
MOBIDE
1999
ACM
14 years 2 months ago
DataSpace - Querying and Monitoring Deeply Networked Collections in Physical Space
In this article we introduce a new conception of three-dimensional DataSpace, which is physical space enhanced by connectivity to the network. DataSpace is addressed geographicall...
Tomasz Imielinski, Samir Goel
ASPDAC
2005
ACM
116views Hardware» more  ASPDAC 2005»
13 years 11 months ago
On combining iteration space tiling with data space tiling for scratch-pad memory systems
Abstract— Most previous studies on tiling concentrate on iteration space only for cache-based memory systems. However, more and more real-time embedded systems are adopting Scrat...
Chunhui Zhang, Fadi J. Kurdahi
DEXA
2008
Springer
117views Database» more  DEXA 2008»
13 years 11 months ago
Space-Partitioning-Based Bulk-Loading for the NSP-Tree in Non-ordered Discrete Data Spaces
Properly-designed bulk-loading techniques are more efficient than the conventional tuple-loading method in constructing a multidimensional index tree for a large data set. Although...
Gang Qian, Hyun-Jeong Seok, Qiang Zhu, Sakti Prama...
JBI
2004
171views Bioinformatics» more  JBI 2004»
13 years 11 months ago
Consensus Clustering and Functional Interpretation of Gene Expression Data
Microarray analysis using clustering algorithms can suffer from lack of inter-method consistency in assigning related gene-expression profiles to clusters. Obtaining a consensus s...
Paul Kellam, Stephen Swift, Allan Tucker, Veronica...
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
14 years 1 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh