Sciweavers

967 search results - page 29 / 194
» Building a Calculus of Data Structures
Sort
View
NIPS
2007
13 years 9 months ago
A learning framework for nearest neighbor search
Can we leverage learning techniques to build a fast nearest-neighbor (ANN) retrieval data structure? We present a general learning framework for the NN problem in which sample que...
Lawrence Cayton, Sanjoy Dasgupta
BMCBI
2005
116views more  BMCBI 2005»
13 years 7 months ago
SuperLigands - a database of ligand structures derived from the Protein Data Bank
Background: Currently, the PDB contains approximately 29,000 protein structures comprising over 70,000 experimentally determined three-dimensional structures of over 5,000 differe...
Elke Michalsky, Mathias Dunkel, Andrean Goede, Rob...
ICDE
2010
IEEE
273views Database» more  ICDE 2010»
14 years 7 months ago
WikiAnalytics: Ad-hoc Querying of Highly Heterogeneous Structured Data
Searching and extracting meaningful information out of highly heterogeneous datasets is a hot topic that received a lot of attention. However, the existing solutions are based on e...
Andrey Balmin, Emiran Curtmola
MTA
2010
175views more  MTA 2010»
13 years 6 months ago
Building a web-scale image similarity search system
As the number of digital images is growing fast and Content-based Image Retrieval (CBIR) is gaining in popularity, CBIR systems should leap towards Webscale datasets. In this paper...
Michal Batko, Fabrizio Falchi, Claudio Lucchese, D...
JCDL
2003
ACM
87views Education» more  JCDL 2003»
14 years 26 days ago
The Web-DL Environment for Building Digital Libraries from the Web
The Web contains a huge volume of unstructured data, which is difficult to manage. In digital libraries, on the other hand, information is explicitly organized, described, and ma...
Pável Calado, Marcos André Gon&ccedi...