Sciweavers

5746 search results - page 348 / 1150
» Visualizing Query Structure
Sort
View
209
Voted
CIKM
2009
Springer
16 years 1 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
BMCBI
2006
120views more  BMCBI 2006»
15 years 6 months ago
Projections for fast protein structure retrieval
Background: In recent times, there has been an exponential rise in the number of protein structures in databases e.g. PDB. So, design of fast algorithms capable of querying such d...
Sourangshu Bhattacharya, Chiranjib Bhattacharyya, ...
205
Voted
OPODIS
2007
15 years 8 months ago
Peer to Peer Multidimensional Overlays: Approximating Complex Structures
Peer to peer overlay networks have proven to be a good support for storing and retrieving data in a fully decentralized way. A sound approach is to structure them in such a way tha...
Olivier Beaumont, Anne-Marie Kermarrec, Etienne Ri...
BMCBI
2005
159views more  BMCBI 2005»
15 years 6 months ago
Columba: an integrated database of proteins, structures, and annotations
Background: Structural and functional research often requires the computation of sets of protein structures based on certain properties of the proteins, such as sequence features,...
Silke Trißl, Kristian Rother, Heiko Mül...
COMPGEOM
2010
ACM
15 years 12 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park