1538 search results - page 97 / 308 » Spectral Techniques in Graph Algorithms |
132
Voted
DAGM
2004
Springer
15 years 9 months ago
2004
Springer
We consider the general problem of learning from labeled and unlabeled data. Given a set of points, some of them are labeled, and the remaining points are unlabeled. The goal is to...
135
Voted
AIRWEB
2007
Springer
15 years 9 months ago
2007
Springer
Web spam can significantly deteriorate the quality of search engines. Early web spamming techniques mainly manipulate page content. Since linkage information is widely used in we...
126
Voted
FORTE
2008
15 years 5 months ago
2008
In software engineering, graphical formalisms, like state-transition tables and automata, are very often indispensable parts of the specifications. Such a formalism usually leads t...
125
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
Frequent coherent subgraphscan provide valuable knowledgeabout the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large...
147
Voted
PVLDB
2010
15 years 1 months ago
2010
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...