Sciweavers

7129 search results - page 913 / 1426
» Approximation Algorithms for Treewidth
Sort
View
131
Voted
BIOCOMP
2008
15 years 6 months ago
Identifying Protein Flexibility by NMA
- Here proposed apriori method for identification of protein flexibility relies on one end-state conformation of the protein. This method has comparative advantage over many others...
Kresimir Sikic, Branko Jeren, Sanja Tomic
NIPS
2008
15 years 6 months ago
One sketch for all: Theory and Application of Conditional Random Sampling
Conditional Random Sampling (CRS) was originally proposed for efficiently computing pairwise (l2, l1) distances, in static, large-scale, and sparse data. This study modifies the o...
Ping Li, Kenneth Ward Church, Trevor Hastie
NIPS
2007
15 years 6 months ago
Anytime Induction of Cost-sensitive Trees
Machine learning techniques are increasingly being used to produce a wide-range of classifiers for complex real-world applications that involve nonuniform testing costs and miscl...
Saher Esmeir, Shaul Markovitch
UAI
2008
15 years 6 months ago
Continuous Time Dynamic Topic Models
In this paper, we develop the continuous time dynamic topic model (cDTM). The cDTM is a dynamic topic model that uses Brownian motion to model the latent topics through a sequenti...
Chong Wang, David M. Blei, David Heckerman
ECIR
2004
Springer
15 years 6 months ago
Fault-Tolerant Fulltext Information Retrieval in Digital Multilingual Encyclopedias with Weighted Pattern Morphing
This paper introduces a new approach to add fault-tolerance to a fulltext retrieval system. The weighted pattern morphing technique circumvents some of the disadvantages of the wid...
Wolfram M. Esser