2137 search results - page 324 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
106
Voted
IPPS
2008
IEEE
15 years 9 months ago
2008
IEEE
Peer-to-peer (P2P) systems are slowly moving from application-specific architectures to a generic serviceoriented design framework. The idea is to allow a dynamic collection of P...
102
Voted
ICCV
2009
IEEE
16 years 7 months ago
2009
IEEE
The concept of graph cuts is by now a standard method
for all sorts of low level vision problems. Its popularity is
largely due to the fact that globally or near globally optimal...
157
Voted
COCOA
2009
Springer
15 years 6 months ago
2009
Springer
Online social network has developed significantly in recent years as a medium of communicating, sharing and disseminating information and spreading influence. Most of current resea...
133
Voted
SSDBM
2010
IEEE
15 years 15 days ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
108
Voted
FUIN
2010
15 years 1 months ago
2010
From an empirical point of view, the hardness of quantified Boolean formulas (QBFs), can be characterized by the (in)ability of current state-of-the-art QBF solvers to decide abo...