359 search results - page 32 / 72 » Online Algorithms for Disk Graphs |
KDD
2007
ACM
16 years 4 days ago
2007
ACM
How can we find communities in dynamic networks of social interactions, such as who calls whom, who emails whom, or who sells to whom? How can we spot discontinuity timepoints in ...
113
click to vote
APVIS
2009
15 years 26 days ago
2009
Visualizing large-scale online social network is a challenging yet essential task. This paper presents HiMap, a system that visualizes it by clustered graph via hierarchical group...
170
click to vote
ICDE
1998
IEEE
16 years 1 months ago
1998
IEEE
We have a large database consisting of sales transactions. We investigate the problem of online mining of association rules in this large database. We show how to preprocess the d...
LSSC
2007
Springer
15 years 5 months ago
2007
Springer
We present a general framework for analysis and design of optimization based numerical feedback stabilization schemes utilizing ideas from relaxed dynamic programming. The applicat...
ESA
2006
Springer
15 years 3 months ago
2006
Springer
We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...