142 search results - page 4 / 29 » Generalizing Graphs Using Amalgamation and Selection |
93
Voted
WWW
2009
ACM
15 years 10 months ago
2009
ACM
In this paper we describe a problem of discovering query clusters from a click-through graph of web search logs. The graph consists of a set of web search queries, a set of pages ...
97
Voted
AE
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...
82
Voted
SIGECOM
2009
ACM
15 years 4 months ago
2009
ACM
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
104
click to vote
BMCBI
2010
14 years 9 months ago
2010
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
PSIVT
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. In a process of insect footprint recognition, footprint segments need to be extracted from scanned insect footprints in order to find out appropriate features for classi...