Sciweavers

207 search results - page 39 / 42
» Data Structures for Storing Small Sets in the Bitprobe Model
Sort
View
IDEAS
2007
IEEE
135views Database» more  IDEAS 2007»
14 years 1 months ago
Bitmap Index Design Choices and Their Performance Implications
Historically, bitmap indexing has provided an important database capability to accelerate queries. However, only a few database systems have implemented these indexes because of t...
Elizabeth J. O'Neil, Patrick E. O'Neil, Kesheng Wu
BMCBI
2007
97views more  BMCBI 2007»
13 years 7 months ago
Relating destabilizing regions to known functional sites in proteins
Background: Most methods for predicting functional sites in protein 3D structures, rely on information on related proteins and cannot be applied to proteins with no known relative...
Benoit H. Dessailly, Marc F. Lensink, Shoshana J. ...
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
14 years 8 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf
CIKM
2009
Springer
14 years 2 months ago
Incremental query evaluation for support vector machines
Support vector machines (SVMs) have been widely used in multimedia retrieval to learn a concept in order to find the best matches. In such a SVM active learning environment, the ...
Danzhou Liu, Kien A. Hua
DASFAA
2009
IEEE
195views Database» more  DASFAA 2009»
14 years 2 months ago
The XMLBench Project: Comparison of Fast, Multi-platform XML libraries
The XML technologies have brought a lot of new ideas and abilities in the field of information management systems. Nowadays, XML is used almost everywhere: from small configurati...
Suren Chilingaryan