Sciweavers

126 search results - page 14 / 26
» Storing a Compressed Function with Constant Time Access
Sort
View
SISAP
2011
IEEE
437views Data Mining» more  SISAP 2011»
12 years 10 months ago
Succinct nearest neighbor search
In this paper we present a novel technique for nearest neighbor searching dubbed neighborhood approximation. The central idea is to divide the database into compact regions repres...
Eric Sadit Tellez, Edgar Chávez, Gonzalo Na...
BMCBI
2010
163views more  BMCBI 2010»
13 years 7 months ago
Integration of open access literature into the RCSB Protein Data Bank using BioLit
Background: Biological data have traditionally been stored and made publicly available through a variety of on-line databases, whereas biological knowledge has traditionally been ...
Andreas Prlic, Marco A. Martinez, Dimitris Dimitro...
INFOCOM
2005
IEEE
14 years 1 months ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
ECOOP
1999
Springer
13 years 12 months ago
Providing Persistent Objects in Distributed Systems
THOR is a persistent object store that provides a powerful programming model. THOR ensures that persistent objects are accessed only by calling their methods and it supports atomic...
Barbara Liskov, Miguel Castro, Liuba Shrira, Atul ...
ANNPR
2008
Springer
13 years 9 months ago
Patch Relational Neural Gas - Clustering of Huge Dissimilarity Datasets
Clustering constitutes an ubiquitous problem when dealing with huge data sets for data compression, visualization, or preprocessing. Prototype-based neural methods such as neural g...
Alexander Hasenfuss, Barbara Hammer, Fabrice Rossi