2612 search results - page 333 / 523 » Switching Graphs and Their Complexity |
125
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
— Complex ad hoc join queries over enterprise databases are commonly used by business data analysts to understand and analyze a variety of enterprise-wide processes. However, eff...
170
click to vote
ECCB
2005
IEEE
15 years 10 months ago
2005
IEEE
Many areas of modern biology are concerned with the management, storage, visualization, comparison, and analysis of networks. For instance, networks are used to model signal trans...
159
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
143
click to vote
COCO
2010
Springer
15 years 8 months ago
2010
Springer
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
140
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...