Sciweavers

10457 search results - page 1440 / 2092
» Data Mapping as Search
Sort
View
CVPR
2012
IEEE
13 years 9 months ago
Computing nearest-neighbor fields via Propagation-Assisted KD-Trees
Matching patches between two images, also known as computing nearest-neighbor fields, has been proven a useful technique in various computer vision/graphics algorithms. But this ...
Kaiming He, Jian Sun
BMCBI
2010
137views more  BMCBI 2010»
15 years 7 months ago
TassDB2 - A comprehensive database of subtle alternative splicing events
Background: Subtle alternative splicing events involving tandem splice sites separated by a short (2-12 nucleotides) distance are frequent and evolutionarily widespread in eukaryo...
Rileen Sinha, Thorsten Lenser, Niels Jahn, Ulrike ...
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
16 years 7 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
CCS
2009
ACM
16 years 2 months ago
Privacy-preserving genomic computation through program specialization
In this paper, we present a new approach to performing important classes of genomic computations (e.g., search for homologous genes) that makes a significant step towards privacy...
Rui Wang, XiaoFeng Wang, Zhou Li, Haixu Tang, Mich...
ICDM
2006
IEEE
130views Data Mining» more  ICDM 2006»
16 years 1 months ago
A Framework for Regional Association Rule Mining in Spatial Datasets
The immense explosion of geographically referenced data calls for efficient discovery of spatial knowledge. One critical requirement for spatial data mining is the capability to ...
Wei Ding 0003, Christoph F. Eick, Jing Wang 0007, ...
« Prev « First page 1440 / 2092 Last » Next »