Sciweavers

1282 search results - page 82 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
BMCBI
2004
208views more  BMCBI 2004»
13 years 10 months ago
Using 3D Hidden Markov Models that explicitly represent spatial coordinates to model and compare protein structures
Background: Hidden Markov Models (HMMs) have proven very useful in computational biology for such applications as sequence pattern matching, gene-finding, and structure prediction...
Vadim Alexandrov, Mark Gerstein
ICPP
2000
IEEE
14 years 2 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
ICANN
2005
Springer
14 years 3 months ago
Reducing the Effect of Out-Voting Problem in Ensemble Based Incremental Support Vector Machines
Although Support Vector Machines (SVMs) have been successfully applied to solve a large number of classification and regression problems, they suffer from the catastrophic forgetti...
Zeki Erdem, Robi Polikar, Fikret S. Gürgen, N...
JVA
2006
IEEE
14 years 4 months ago
Simulated Annealing for Grid Scheduling Problem
Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geographicall...
Stefka Fidanova
FOCS
2009
IEEE
14 years 5 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry