3341 search results - page 73 / 669 » Managing a Large |
132
click to vote
CIKM
2010
Springer
15 years 7 hour ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
131
click to vote
KDD
2008
ACM
16 years 1 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
126
click to vote
KDD
2007
ACM
16 years 1 months ago
2007
ACM
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
105
click to vote
VISUALIZATION
2005
IEEE
15 years 7 months ago
2005
IEEE
We present a practical and general-purpose approach to large and complex visual data analysis where visualization processing, rendering and subsequent human interpretation is cons...
140
click to vote
ICAIL
2005
ACM
15 years 7 months ago
2005
ACM
Computational resources for research in legal environments have historically implied remote access to large databases of legal documents such as case law, statutes, law reviews an...