Sciweavers

37 search results - page 7 / 8
» A Low Communication Sort Algorithm for a Parallel Database M...
Sort
View
ICDCS
2002
IEEE
13 years 11 months ago
A Fully Distributed Framework for Cost-Sensitive Data Mining
Data mining systems aim to discover patterns and extract useful information from facts recorded in databases. A widely adopted approach is to apply machine learning algorithms to ...
Wei Fan, Haixun Wang, Philip S. Yu, Salvatore J. S...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
13 years 11 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
OOPSLA
2010
Springer
13 years 4 months ago
Cross-language, type-safe, and transparent object sharing for co-located managed runtimes
As software becomes increasingly complex and difficult to analyze, it is more and more common for developers to use high-level, type-safe, object-oriented (OO) programming langua...
Michal Wegiel, Chandra Krintz
CLOUD
2010
ACM
13 years 11 months ago
G-Store: a scalable data store for transactional multi key access in the cloud
Cloud computing has emerged as a preferred platform for deploying scalable web-applications. With the growing scale of these applications and the data associated with them, scalab...
Sudipto Das, Divyakant Agrawal, Amr El Abbadi
WWW
2005
ACM
14 years 6 months ago
LSH forest: self-tuning indexes for similarity search
We consider the problem of indexing high-dimensional data for answering (approximate) similarity-search queries. Similarity indexes prove to be important in a wide variety of sett...
Mayank Bawa, Tyson Condie, Prasanna Ganesan