Sciweavers

2228 search results - page 386 / 446
» Distributed Data Clustering Can Be Efficient and Exact
Sort
View
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
14 years 10 months ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella
KDD
2007
ACM
237views Data Mining» more  KDD 2007»
14 years 9 months ago
Knowledge discovery of multiple-topic document using parametric mixture model with dirichlet prior
Documents, such as those seen on Wikipedia and Folksonomy, have tended to be assigned with multiple topics as a meta-data. Therefore, it is more and more important to analyze a re...
Issei Sato, Hiroshi Nakagawa
CIKM
2000
Springer
14 years 1 months ago
Dimensionality Reduction and Similarity Computation by Inner Product Approximations
—As databases increasingly integrate different types of information such as multimedia, spatial, time-series, and scientific data, it becomes necessary to support efficient retri...
Ömer Egecioglu, Hakan Ferhatosmanoglu
BMCBI
2010
132views more  BMCBI 2010»
13 years 9 months ago
Protein docking by Rotation-Based Uniform Sampling (RotBUS) with fast computing of intermolecular contact distance and residue d
Background: Protein-protein interactions are fundamental for the majority of cellular processes and their study is of enormous biotechnological and therapeutic interest. In recent...
Albert Solernou, Juan Fernández-Recio
BMCBI
2010
117views more  BMCBI 2010»
13 years 9 months ago
Beyond rotamers: a generative, probabilistic model of side chains in proteins
Background: Accurately covering the conformational space of amino acid side chains is essential for important applications such as protein design, docking and high resolution stru...
Tim Harder, Wouter Boomsma, Martin Paluszewski, Je...