Sciweavers

3941 search results - page 266 / 789
» Computational Efficiency of Batching Methods
Sort
View
VLDB
2008
ACM
147views Database» more  VLDB 2008»
16 years 4 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
DEXAW
2000
IEEE
160views Database» more  DEXAW 2000»
15 years 8 months ago
An Adaptive AVI-Based Cache Invalidation Scheme for Mobile Computing Systems
In a mobile computing system, caching data items at the mobile clients is important to reduce the data access delay in a unreliable and low bandwidth mobile network. However, effi...
Joe Chun-Hung Yuen, Edward Chan, Kam-yiu Lam, Hei-...
ESORICS
2004
Springer
15 years 9 months ago
Signature Bouquets: Immutability for Aggregated/Condensed Signatures
Database outsourcing is a popular industry trend which involves organizations delegating their data management needs to an external service provider. In this model, a service prov...
Einar Mykletun, Maithili Narasimha, Gene Tsudik
ESA
1998
Springer
162views Algorithms» more  ESA 1998»
15 years 7 months ago
External Memory Algorithms
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
Jeffrey Scott Vitter
BMCBI
2006
95views more  BMCBI 2006»
15 years 4 months ago
Discrete profile comparison using information bottleneck
Sequence homologs are an important source of information about proteins. Amino acid profiles, representing the position-specific mutation probabilities found in profiles, are a ri...
Sean O'Rourke, Gal Chechik, Robin Friedman, Eleaza...