Sciweavers

344 search results - page 41 / 69
» Streaming Algorithms for extent problems in high dimensions
Sort
View
STOC
2003
ACM
178views Algorithms» more  STOC 2003»
16 years 1 months ago
Uniform hashing in constant time and linear space
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
Anna Östlin, Rasmus Pagh
DCC
2007
IEEE
16 years 1 months ago
Low-density attack revisited
The low-density attack proposed by Lagarias and Odlyzko is a powerful algorithm against the subset sum problem. The improvement algorithm due to Coster et al. would solve almost a...
Tetsuya Izu, Jun Kogure, Takeshi Koshiba, Takeshi ...
MMS
2006
15 years 1 months ago
View-invariant motion trajectory-based activity classification and recognition
Motion trajectories provide rich spatio-temporal information about an object's activity. The trajectory information can be obtained using a tracking algorithm on data streams ...
Faisal I. Bashir, Ashfaq A. Khokhar, Dan Schonfeld
KDD
2008
ACM
186views Data Mining» more  KDD 2008»
16 years 1 months ago
Scalable and near real-time burst detection from eCommerce queries
In large scale online systems like Search, eCommerce, or social network applications, user queries represent an important dimension of activities that can be used to study the imp...
Nish Parikh, Neel Sundaresan
NIPS
2008
15 years 2 months ago
One sketch for all: Theory and Application of Conditional Random Sampling
Conditional Random Sampling (CRS) was originally proposed for efficiently computing pairwise (l2, l1) distances, in static, large-scale, and sparse data. This study modifies the o...
Ping Li, Kenneth Ward Church, Trevor Hastie