243 search results - page 35 / 49 » On Balanced Graphs |
170
click to vote
SIGMOD
2007
ACM
15 years 9 months ago
2007
ACM
Data availability, collection and storage have increased dramatically in recent years, raising new technological and algorithmic challenges for database design and data management...
LATIN
2010
Springer
15 years 4 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
AAMAS
2012
Springer
13 years 5 months ago
2012
Springer
In multiagent settings where agents have different preferences, preference aggregation can be an important issue. Voting is a general method to aggregate preferences. We consider ...
JCP
2006
14 years 9 months ago
2006
- In order to enable fast deployment of new emerging services over multimedia radio networks, it is important to design an efficient service-based platform with necessary traffic m...
SCAM
2006
IEEE
15 years 3 months ago
2006
IEEE
Programmers often want to transform the source or binary representations of their programs (e.g., to optimize, add dynamic safety checks, or add profile gathering code). Unfortun...