Sciweavers

868 search results - page 48 / 174
» A general compression algorithm that supports fast searching
Sort
View
BMCBI
2008
171views more  BMCBI 2008»
13 years 7 months ago
A general approach to simultaneous model fitting and variable elimination in response models for biological data with many more
Background: With the advent of high throughput biotechnology data acquisition platforms such as micro arrays, SNP chips and mass spectrometers, data sets with many more variables ...
Harri T. Kiiveri
MMDB
2003
ACM
178views Multimedia» more  MMDB 2003»
14 years 29 days ago
Video query processing in the VDBMS testbed for video database research
The increased use of video data sets for multimedia-based applications has created a demand for strong video database support, including efficient methods for handling the content...
Walid G. Aref, Moustafa A. Hammad, Ann Christine C...
KDD
2009
ACM
152views Data Mining» more  KDD 2009»
14 years 8 months ago
TANGENT: a novel, 'Surprise me', recommendation algorithm
Most of recommender systems try to find items that are most relevant to the older choices of a given user. Here we focus on the "surprise me" query: A user may be bored ...
Kensuke Onuma, Hanghang Tong, Christos Faloutsos
SSDBM
2010
IEEE
220views Database» more  SSDBM 2010»
14 years 1 days ago
Prefix Tree Indexing for Similarity Search and Similarity Joins on Genomic Data
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....
Astrid Rheinländer, Martin Knobloch, Nicky Ho...
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 8 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb