Sciweavers

2010 search results - page 362 / 402
» Feature Subset Selection Using a Genetic Algorithm
Sort
View
JCPHY
2011
192views more  JCPHY 2011»
14 years 5 months ago
Fast analysis of molecular dynamics trajectories with graphics processing units - Radial distribution function histogramming
The calculation of radial distribution functions (RDFs) from molecular dynamics trajectory data is a common and computationally expensive analysis task. The rate limiting step in ...
Benjamin G. Levine, John E. Stone, Axel Kohlmeyer
127
Voted
KDD
2009
ACM
132views Data Mining» more  KDD 2009»
16 years 2 months ago
Learning patterns in the dynamics of biological networks
Our dynamic graph-based relational mining approach has been developed to learn structural patterns in biological networks as they change over time. The analysis of dynamic network...
Chang Hun You, Lawrence B. Holder, Diane J. Cook
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
15 years 5 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
DAS
2010
Springer
15 years 6 months ago
Nearest neighbor based collection OCR
Conventional optical character recognition (OCR) systems operate on individual characters and words, and do not normally exploit document or collection context. We describe a Coll...
K. Pramod Sankar, C. V. Jawahar, Raghavan Manmatha
IVC
2007
131views more  IVC 2007»
15 years 2 months ago
Multi-view correspondence by enforcement of rigidity constraints
Establishing the correct correspondence between features in an image set remains a challenging problem amongst computer vision researchers. In fact, the combinatorial nature of fe...
Ricardo Oliveira, João Xavier, João ...