#### Filter Results:

#### Publication Year

1992

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

We show that some basic linear control design problems are NP-hard, implying that, unless P=NP, they cannot be solved by polynomial time algorithms. The problems that we consider include simultaneous stabilization by output feedback, stabilization by state or output feedback in the presence of bounds on the elements of the gain matrix, and decentralized… (More)

- Vincent Blondel, Michel Gevers, Anders Lindquist
- Eur. J. Control
- 1995

- Chloë Brown, Anastasios Noulas, Cecilia Mascolo, Vincent Blondel
- 2013 International Conference on Social Computing
- 2013

The focused organization theory of social ties proposes that the structure of human social networks can be arranged around extra-network foci, which can include shared physical spaces such as homes, workplaces, restaurants, and so on. Until now, this has been difficult to investigate on a large scale, but the huge volume of data available from online… (More)

- DESIGN PROBLEMS, VINCENT BLONDEL, JOHN N. TSITSIKLIS
- 1997

We show that some basic linear control design problems are NP-hard, implying that, unless P=NP, they cannot be solved by polynomial time algorithms. The problems that we consider include simultaneous stabilization by output feedback, stabilization by state or output feedback in the presence of bounds on the elements of the gain matrix, and decentralized… (More)

- V. Blondel
- 1992

We show that the simultaneous stabilizability of three linear systems, that is the question of knowing whether three linear systems are simultaneously stabilizable, is an undecidable question. It is undecidable in the sense that it is not possible to find necessary and sufficient conditions for simultaneous stabilization of the three systems that involve… (More)

We introduce the definition of Social Leader that gives a local centrality measure for each node in a graph. A node u is a Social Leader if the number of cycles of length 3 passing through u is greater than the corresponding number for its neighbors. This concept is used to visualize large graphs, identify in-fluent agents in social networks (word of mouth… (More)

- Chloë Brown, Neal Lathia, Anastasios Noulas, Cecilia Mascolo, Vincent Blondel
- PloS one
- 2014

We analyze two large datasets from technological networks with location and social data: user location records from an online location-based social networking service, and anonymized telecommunications data from a European cellphone operator, in order to investigate the differences between individual and group behavior with respect to physical location. We… (More)

- Vincent Blondel, Kyomin Jung, Pushmeet Kohli, Devavrat Shah
- ArXiv
- 2013

This paper presents a novel meta algorithm, Partition-Merge (PM), which takes existing centralized algorithms for graph computation and makes them distributed and faster. In a nutshell, PM divides the graph into small subgraphs using our novel randomized partitioning scheme, runs the centralized algorithm on each partition separately, and then stitches the… (More)

- Balázs Gerencsér, Christophe Cloquet, Vincent Blondel
- ArXiv
- 2015

We introduce an improved model for human communication patterns, in particular for arrival times of Twitter tweets. We introduce a concept that allows to capture the dependence of subsequent waiting times between such events. The presence of such dependence not only matches intuition, but the data shows a significantly better fit for the new model, thus… (More)

- Olivier Bournez, Eugène ASARIN, +4 authors Jean-Yves MARION
- 2007