Sciweavers

21 search results - page 4 / 5
» Using d-gap patterns for index compression
Sort
View
WWW
2010
ACM
14 years 1 months ago
A pattern tree-based approach to learning URL normalization rules
Duplicate URLs have brought serious troubles to the whole pipeline of a search engine, from crawling, indexing, to result serving. URL normalization is to transform duplicate URLs...
Tao Lei, Rui Cai, Jiang-Ming Yang, Yan Ke, Xiaodon...
MCS
2008
Springer
13 years 5 months ago
Dynamical low-rank approximation: applications and numerical experiments
Dynamical low-rank approximation is a differential-equation based approach to efficiently computing low-rank approximations to time-dependent large data matrices or to solutions o...
Achim Nonnenmacher, Christian Lubich
FOCS
2009
IEEE
13 years 10 months ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
CORR
2007
Springer
110views Education» more  CORR 2007»
13 years 6 months ago
Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting
The problem of recovering the sparsity pattern of a fixed but unknown vector β∗ ∈ Rp based on a set of n noisy observations arises in a variety of settings, including subset...
Martin J. Wainwright
CIDR
2007
177views Algorithms» more  CIDR 2007»
13 years 7 months ago
bdbms - A Database Management System for Biological Data
Biologists are increasingly using databases for storing and managing their data. Biological databases typically consist of a mixture of raw data, metadata, sequences, annotations,...
Mohamed Y. Eltabakh, Mourad Ouzzani, Walid G. Aref