Sciweavers

5473 search results - page 686 / 1095
» On the graph isomorphism problem
Sort
View
200
Voted
IS
2007
15 years 6 months ago
Discovering frequent geometric subgraphs
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
Michihiro Kuramochi, George Karypis
TON
2008
106views more  TON 2008»
15 years 6 months ago
On static and dynamic partitioning behavior of large-scale P2P networks
Abstract--In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node fail...
Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri...
CN
2002
78views more  CN 2002»
15 years 6 months ago
A stochastic model for the evolution of the Web
Recently several authors have proposed stochastic models of the growth of the Web graph that give rise to power-law distributions. These models are based on the notion of preferen...
Mark Levene, Trevor I. Fenner, George Loizou, Rich...
SIAMCOMP
2010
97views more  SIAMCOMP 2010»
15 years 5 months ago
Designing Network Protocols for Good Equilibria
Designing and deploying a network protocol determines the rules by which end users interact with each other and with the network. We consider the problem of designing a protocol t...
Ho-Lin Chen, Tim Roughgarden, Gregory Valiant
ATVA
2010
Springer
142views Hardware» more  ATVA 2010»
15 years 4 months ago
On Scenario Synchronization
: Narrowing the wide conceptual gap between problem and implementation domains is considered a significant factor within software engineering. Currently, such a relation is often o...
Duc-Hanh Dang, Anh-Hoang Truong, Martin Gogolla