1402 search results - page 210 / 281 » Sparse-Memory Graph Search |
105
click to vote
KDD
2003
ACM
16 years 2 months ago
2003
ACM
We are interested in finding natural communities in largescale linked networks. Our ultimate goal is to track changes over time in such communities. For such temporal tracking, we...
219
Voted
SIGMOD
2007
ACM
16 years 2 months ago
2007
ACM
Data availability, collection and storage have increased dramatically in recent years, raising new technological and algorithmic challenges for database design and data management...
118
Voted
EDBT
2004
ACM
16 years 2 months ago
2004
ACM
In this paper we present HOPI, a new connection index for XML documents based on the concept of the 2?hop cover of a directed graph introduced by Cohen et al. In contrast to most o...
97
Voted
ICCAD
2005
IEEE
15 years 11 months ago
2005
IEEE
Clustering (or partitioning) is a crucial step between logic synthesis and physical design in the layout of a large scale design. A design verified at the logic synthesis level m...
120
Voted
ICCAD
2001
IEEE
15 years 11 months ago
2001
IEEE
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...