Sciweavers

1163 search results - page 59 / 233
» Embedding into Bipartite Graphs
Sort
View
148
Voted
IPPS
1998
IEEE
15 years 10 months ago
Emulating Direct Products by Index-Shuffle Graphs
In the theoretical framework of graph embedding and network emulations, we show that the index-shuffle graph (a bounded-degreehypercube-like interconnection network, recently intr...
Bojana Obrenic
143
Voted
SIGIR
2006
ACM
16 years 3 days ago
Respect my authority!: HITS without hyperlinks, utilizing cluster-based language models
We present an approach to improving the precision of an initial document ranking wherein we utilize cluster information within a graph-based framework. The main idea is to perform...
Oren Kurland, Lillian Lee
DM
2007
59views more  DM 2007»
15 years 6 months ago
Non-existence of nonorientable regular embeddings of n-dimensional cubes
By a regular embedding of a graph K into a surface we mean a 2-cell embedding of K into a compact connected surface with the automorphism group acting regularly on flags. Regular...
Young Soo Kwon, Roman Nedela
176
Voted
ISAAC
2005
Springer
153views Algorithms» more  ISAAC 2005»
15 years 11 months ago
Network Game with Attacker and Protector Entities
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
Marios Mavronicolas, Vicky G. Papadopoulou, Anna P...
158
Voted
WWW
2004
ACM
16 years 6 months ago
Semantic api matching for automatic service composition
In this paper, we address the problem of matching I/O descriptions of services to enable their automatic service composition. Specifically, we develop a method of semantic schema ...
Doina Caragea, Tanveer Fathima Syeda-Mahmood