Sciweavers

79 search results - page 5 / 16
» Graph Extremities Defined by Search Algorithms
Sort
View
WWW
2005
ACM
14 years 10 months ago
Partitioning of Web graphs by community topology
We introduce a stricter Web community definition to overcome boundary ambiguity of a Web community defined by Flake, Lawrence and Giles [2], and consider the problem of finding co...
Hidehiko Ino, Mineichi Kudo, Atsuyoshi Nakamura
WWW
2008
ACM
14 years 10 months ago
A differential notion of place for local search
For extracting the characteristics a specific geographic entity, and notably a place, we propose to use dynamic Extreme Tagging Systems in combination with the classic approach of...
Vlad Tanasescu, John Domingue
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
14 years 10 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...
CIKM
2009
Springer
14 years 1 months ago
Efficient processing of group-oriented connection queries in a large graph
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
James Cheng, Yiping Ke, Wilfred Ng
EACL
1993
ACL Anthology
13 years 11 months ago
Disjunctions and Inheritance in the Context Feature Structure System
Substantial efforts have been made in order to cope with disjunctions in constraint based grammar formalisms (e.g. [Kasper, 1987; Maxwell and Kaplan, 1991; DSrre and Eisele, 1990]...
Martin Böttcher