Sciweavers

1670 search results - page 131 / 334
» Fast Computation of Data Correlation Using BDDs
Sort
View
146
Voted
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
15 years 7 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
IMC
2010
ACM
15 years 1 months ago
Listen to me if you can: tracking user experience of mobile network on social media
Social media sites such as Twitter continue to grow at a fast pace. People of all generations use social media to exchange messages and share experiences of their life in a timely...
Tongqing Qiu, Junlan Feng, Zihui Ge, Jia Wang, Jun...
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
16 years 3 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
HICSS
2006
IEEE
165views Biometrics» more  HICSS 2006»
15 years 9 months ago
The Data Warehouse in a Distributed Utility Environment
Utility provisioning, Grid resource management, instant copy kiosks, and network transfers provide an exciting new paradigm for data warehouse functions. Grid technologies are fas...
Charles A. Milligan
180
Voted
SDM
2012
SIAM
247views Data Mining» more  SDM 2012»
13 years 5 months ago
Simplex Distributions for Embedding Data Matrices over Time
Early stress recognition is of great relevance in precision plant protection. Pre-symptomatic water stress detection is of particular interest, ultimately helping to meet the chal...
Kristian Kersting, Mirwaes Wahabzada, Christoph R&...