Sciweavers

6248 search results - page 1157 / 1250
» Programming in a data factory
Sort
View
STOC
2004
ACM
145views Algorithms» more  STOC 2004»
16 years 3 months ago
Using mixture models for collaborative filtering
A collaborative filtering system at an e-commerce site or similar service uses data about aggregate user behavior to make recommendations tailored to specific user interests. We d...
Jon M. Kleinberg, Mark Sandler
138
Voted
ICALP
2009
Springer
16 years 3 months ago
Dynamic Succinct Ordered Trees
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
Arash Farzan, J. Ian Munro
243
Voted
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
16 years 3 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li
SIGMOD
2007
ACM
186views Database» more  SIGMOD 2007»
16 years 3 months ago
An efficient and accurate method for evaluating time series similarity
A variety of techniques currently exist for measuring the similarity between time series datasets. Of these techniques, the methods whose matching criteria is bounded by a specifi...
Michael D. Morse, Jignesh M. Patel
SIGMOD
2006
ACM
89views Database» more  SIGMOD 2006»
16 years 3 months ago
Testing database applications
Testing of database applications is crucial for ensuring high software quality as undetected faults can result in unrecoverable data corruption. The problem of database applicatio...
Carsten Binnig, Donald Kossmann, Eric Lo
« Prev « First page 1157 / 1250 Last » Next »