Sciweavers

3341 search results - page 70 / 669
» Managing a Large
Sort
View
WWW
2007
ACM
16 years 2 months ago
Towards effective browsing of large scale social annotations
This paper is concerned with the problem of browsing social annotations. Today, a lot of services (e.g., Del.icio.us, Filckr) have been provided for helping users to manage and sh...
Rui Li, Shenghua Bao, Yong Yu, Ben Fei, Zhong Su
BTW
2009
Springer
240views Database» more  BTW 2009»
15 years 2 months ago
Efficient Adaptive Retrieval and Mining in Large Multimedia Databases
Abstract: Multimedia databases are increasingly common in science, business, entertainment and many other applications. Their size and high dimensionality of features are major cha...
Ira Assent
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
16 years 1 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
KDD
2002
ACM
145views Data Mining» more  KDD 2002»
16 years 1 months ago
Handling very large numbers of association rules in the analysis of microarray data
The problem of analyzing microarray data became one of important topics in bioinformatics over the past several years, and different data mining techniques have been proposed for ...
Alexander Tuzhilin, Gediminas Adomavicius
ECOOP
2004
Springer
15 years 6 months ago
Finding and Removing Performance Bottlenecks in Large Systems
Abstract. Software systems obey the 80/20 rule: aggressively optimizing a vital few execution paths yields large speedups. However, finding the vital few paths can be difficult, e...
Glenn Ammons, Jong-Deok Choi, Manish Gupta, Nikhil...