Sciweavers

4850 search results - page 227 / 970
» Approximate Data Structures with Applications
Sort
View
BMCBI
2010
154views more  BMCBI 2010»
15 years 6 months ago
Binary image representation of a ligand binding site: its application to efficient sampling of a conformational ensemble
Background: Modelling the ligand binding site of a protein is an important component of understanding proteinligand interactions and is being actively studied. Even if the side ch...
Edon Sung, Sangsoo Kim, Whanchul Shin
ICANN
2010
Springer
15 years 6 months ago
Tumble Tree - Reducing Complexity of the Growing Cells Approach
We propose a data structure that decreases complexity of unsupervised competitive learning algorithms which are based on the growing cells structures approach. The idea is based on...
Hendrik Annuth, Christian-A. Bohn
IS
2006
15 years 6 months ago
A methodology for clustering XML documents by structure
The processing and management of XML data are popular research issues. However, operations based on the structure of XML data have not received strong attention. These operations ...
Theodore Dalamagas, Tao Cheng, Klaas-Jan Winkel, T...
ICASSP
2011
IEEE
14 years 10 months ago
A clustering based framework for dictionary block structure identification
Sparse representations over redundant dictionaries offer an efficient paradigm for signal representation. Recently block-sparsity has been put forward as a prior condition for so...
Ender M. Eksioglu
DASFAA
2003
IEEE
108views Database» more  DASFAA 2003»
15 years 11 months ago
Spatial Query Processing for High Resolutions
Modern database applications including computeraided design (CAD), medical imaging, or molecular biology impose new requirements on spatial query processing. Particular problems a...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...