966 search results - page 187 / 194 » Small Alliances in Graphs |
103
click to vote
AAAI
2010
15 years 1 months ago
2010
In computational social choice, one important problem is to take the votes of a subelectorate (subset of the voters), and summarize them using a small number of bits. This needs t...
181
click to vote
SYRCODIS
2008
15 years 1 months ago
2008
In the last few years, XML became a de-facto standard for the exchange of structured and semi-structured data. The database research community took this development into account b...
107
Voted
SODA
2001
ACM
15 years 1 months ago
2001
ACM
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...
130
click to vote
WOTUG
2007
15 years 28 days ago
2007
Concurrency control mechanisms such as turn-taking, locking, serialization, transactional locking mechanism, and operational transformation try to provide data consistency when con...
AML
2007
14 years 12 months ago
2007
We study the notion of weak dividing introduced by S. Shelah. In particular we prove that T is stable iff weak dividing is symmetric. In order to study simple theories Shelah orig...