1402 search results - page 28 / 281 » Sparse-Memory Graph Search |
73
Voted
ESA
2009
Springer
15 years 4 months ago
2009
Springer
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
STOC
1996
ACM
15 years 1 months ago
1996
ACM
We introduce a variant of Aldous and Vazirani's \Go with the winners" algorithm that can be used for search graphs that are not trees. We analyze the algorithm in terms ...
ESWS
2010
Springer
15 years 2 months ago
2010
Springer
While the Semantic Web is rapidly filling up, appropriate tools for searching it are still at infancy. In this paper we describe an approach that allows humans to access informatio...
112
click to vote
PKDD
2004
Springer
15 years 3 months ago
2004
Springer
The next wave in search technology will be driven by the identification, extraction, and exploitation of real-world entities represented in unstructured textual sources. Search sy...
ICDM
2010
IEEE
14 years 7 months ago
2010
IEEE
Nowadays, the classification of graph data has become an important and active research topic in the last decade, which has a wide variety of real world applications, e.g. drug acti...