Sciweavers

9209 search results - page 434 / 1842
» Data Space Randomization
Sort
View
SSDBM
2010
IEEE
105views Database» more  SSDBM 2010»
15 years 12 months ago
Organization of Data in Non-convex Spatial Domains
We present a technique for organizing data in spatial databases with non-convex domains based on an automatic characterization using the medial-axis transform (MAT). We define a t...
Eric A. Perlman, Randal C. Burns, Michael M. Kazhd...
AAAI
2011
14 years 6 months ago
Heterogeneous Transfer Learning with RBMs
A common approach in machine learning is to use a large amount of labeled data to train a model. Usually this model can then only be used to classify data in the same feature spac...
Bin Wei, Christopher Pal
SDM
2009
SIAM
205views Data Mining» more  SDM 2009»
16 years 4 months ago
Identifying Information-Rich Subspace Trends in High-Dimensional Data.
Identifying information-rich subsets in high-dimensional spaces and representing them as order revealing patterns (or trends) is an important and challenging research problem in m...
Chandan K. Reddy, Snehal Pokharkar
COMSWARE
2008
IEEE
16 years 1 months ago
An efficient and bandwidth sensitive parallel download scheme in data grids
—For modern scientific applications such as astrophysics, astronomy, aerography, and biology, a large amount of storage space is required because of the large-scale datasets. Dat...
Ruay-Shiung Chang, Chun-Fu Lin, Jiing-Hsing Ruey, ...
SPIRE
2005
Springer
16 years 10 days ago
Rank-Sensitive Data Structures
Output-sensitive data structures result from preprocessing n items and are capable of reporting the items satisfying an on-line query in O(t(n) + ℓ) time, where t(n) is the cost ...
Iwona Bialynicka-Birula, Roberto Grossi