3360 search results - page 98 / 672 » Opportunistic Data Structures with Applications |
130
click to vote
KDD
2007
ACM
16 years 3 months ago
2007
ACM
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
135
click to vote
KDD
2005
ACM
16 years 3 months ago
2005
ACM
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
111
click to vote
ICCV
1999
IEEE
16 years 5 months ago
1999
IEEE
In this paper we investigate the geometry and algebra of multiple projections of lines with affine cameras. Previously, the case of seven lines in three images has been studied. I...
153
click to vote
KDD
2008
ACM
16 years 3 months ago
2008
ACM
Traditionally, research in identifying structured entities in documents has proceeded independently of document categorization research. In this paper, we observe that these two t...
122
click to vote
ICS
2001
Tsinghua U.
15 years 8 months ago
2001
Tsinghua U.
The caching behavior of multimedia applications has been described as having high instruction reference locality within small loops, very large working sets, and poor data cache p...