Sciweavers

3341 search results - page 71 / 669
» Managing a Large
Sort
View
UBIMOB
2009
ACM
225views Management» more  UBIMOB 2009»
15 years 6 months ago
Historical data storage for large scale sensor networks
Wireless sensor networks are rapidly finding their way through a plethora of new applications like precision farming and forestry, with increasing network scale, system complexit...
Loïc Petit, Abdelhamid Nafaa, Raja Jurdak
EDBT
2009
ACM
156views Database» more  EDBT 2009»
15 years 6 months ago
Evaluating very large datalog queries on social networks
We consider a near future scenario in which users of a Web 2.0 application, such as a social network, contribute to the application not only data, but also rules which automatical...
Royi Ronen, Oded Shmueli
KDD
2000
ACM
222views Data Mining» more  KDD 2000»
15 years 5 months ago
Interactive exploration of very large relational datasets through 3D dynamic projections
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
Li Yang
SIGMOD
2008
ACM
157views Database» more  SIGMOD 2008»
16 years 1 months ago
CRD: fast co-clustering on large datasets utilizing sampling-based matrix decomposition
The problem of simultaneously clustering columns and rows (coclustering) arises in important applications, such as text data mining, microarray analysis, and recommendation system...
Feng Pan, Xiang Zhang, Wei Wang 0010
SAC
2009
ACM
15 years 8 months ago
Applying latent dirichlet allocation to group discovery in large graphs
This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (suc...
Keith Henderson, Tina Eliassi-Rad