715 search results - page 73 / 143 » On graphs with subgraphs having large independence numbers |
102
click to vote
SIGCOMM
1998
ACM
15 years 4 months ago
1998
ACM
Many emerging applications (e.g., teleconference, real-time information services, pay per view, distributed interactive simulation, and collaborative work) are based upon a group ...
MFCS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We study the existence and tractability of a notion of approximate equilibria in bimatrix games, called well supported approximate Nash Equilibria (SuppNE in short). We p...
112
click to vote
WINE
2009
Springer
15 years 6 months ago
2009
Springer
We consider weighted linear congestion games, and investigate how social ignorance, namely lack of information about the presence of some players, affects the inefficiency of pure...
173
click to vote
ICDE
2000
IEEE
16 years 1 months ago
2000
IEEE
Dynamic Miss-Countingalgorithms are proposed, which find all implication and similarity rules with confidence pruning but without support pruning. To handle data sets with a large...
116
click to vote
DCC
1998
IEEE
15 years 4 months ago
1998
IEEE
Multiple description coding (MDC) is source coding for multiple channels such that a decoder which receives an arbitrary subset of the channels may produce a useful reconstruction...