Sciweavers

1814 search results - page 262 / 363
» Watermarking relational data: framework, algorithms and anal...
Sort
View
FAST
2007
15 years 21 days ago
AMP: Adaptive Multi-stream Prefetching in a Shared Cache
Abstract— Prefetching is a widely used technique in modern data storage systems. We study the most widely used class of prefetching algorithms known as sequential prefetching. Th...
Binny S. Gill, Luis Angel D. Bathen
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
15 years 11 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
JCB
2007
198views more  JCB 2007»
14 years 11 months ago
Bayesian Hierarchical Model for Large-Scale Covariance Matrix Estimation
Many bioinformatics problems can implicitly depend on estimating large-scale covariance matrix. The traditional approaches tend to give rise to high variance and low accuracy esti...
Dongxiao Zhu, Alfred O. Hero III
VALUETOOLS
2006
ACM
166views Hardware» more  VALUETOOLS 2006»
15 years 5 months ago
Web graph analyzer tool
We present the software tool “Web Graph Analyzer”. This tool is designed to perform a comprehensive analysis of the Web Graph structure. By Web Graph we mean a graph whose ver...
Konstantin Avrachenkov, Danil Nemirovsky, Natalia ...
AI
2006
Springer
14 years 11 months ago
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
Ole J. Mengshoel, David C. Wilkins, Dan Roth