4679 search results - page 138 / 936 » Modeling When Connections Are the Problem |
110
click to vote
ISAAC
2009
Springer
15 years 6 months ago
2009
Springer
For a connected graph G = (V, E), a subset U ⊆ V is called a k-cut if U disconnects G, and the subgraph induced by U contains exactly k (≥ 1) components. More specifically, a ...
132
Voted
ISAAC
2007
Springer
15 years 7 months ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
100
click to vote
SAC
2005
ACM
15 years 7 months ago
2005
ACM
Users’ search needs are often represented by words and images are retrieved according to such textual queries. Annotation words assigned to the stored images are most useful to ...
147
click to vote
WAW
2010
Springer
14 years 11 months ago
2010
Springer
We study the effect of information overload on user engagement in an asymmetric social network like Twitter. We introduce simple game-theoretic models that capture rate competition...
134
Voted
KDD
2009
ACM
16 years 2 months ago
2009
ACM
Social media such as blogs, Facebook, Flickr, etc., presents data in a network format rather than classical IID distribution. To address the interdependency among data instances, ...