2612 search results - page 248 / 523 » Switching Graphs and Their Complexity |
158
click to vote
COCOON
2007
Springer
16 years 2 days ago
2007
Springer
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
168
click to vote
ICWS
2004
IEEE
15 years 7 months ago
2004
IEEE
Service composition refers to the aggregation of services to build complex applications to achieve client requirements. It is an important challenge to make it possible for users ...
166
click to vote
PODC
2009
ACM
16 years 6 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
344
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
122
click to vote
CVPR
1999
IEEE
16 years 8 months ago
1999
IEEE
We present a stochastic clustering algorithm which uses pairwise similarity of elements, based on a new graph theoretical algorithm for the sampling of cuts in graphs. The stochas...