Sciweavers

779 search results - page 95 / 156
» A graph polynomial for independent sets of bipartite graphs
Sort
View
ICCS
2009
Springer
15 years 4 months ago
Distinguishing Answers in Conceptual Graph Knowledge Bases
Abstract. In knowledge bases, the open world assumption and the ability to express variables may lead to an answer redundancy problem. This problem occurs when the returned answers...
Nicolas Moreau, Michel Leclère, Madalina Cr...
ACSC
2009
IEEE
15 years 4 months ago
A ConceptLink Graph for Text Structure Mining
Most text mining methods are based on representing documents using a vector space model, commonly known as a bag of word model, where each document is modeled as a linear vector r...
Rowena Chau, Ah Chung Tsoi, Markus Hagenbuchner, V...
APPROX
2010
Springer
179views Algorithms» more  APPROX 2010»
14 years 11 months ago
Rumor Spreading on Random Regular Graphs and Expanders
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
Nikolaos Fountoulakis, Konstantinos Panagiotou
KDD
2007
ACM
227views Data Mining» more  KDD 2007»
15 years 10 months ago
Fast best-effort pattern matching in large attributed graphs
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...
Hanghang Tong, Christos Faloutsos, Brian Gallagher...
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
14 years 19 days ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...