Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Review

2019

Review

2019

Research into self-regulated learning has traditionally relied upon self-reported data. While there is a rich body of literature… Expand

Review

2018

Review

2018

Over the last fifty years, research into street networks has gained prominence with a rapidly growing number of studies across… Expand

Review

2018

Review

2018

Research in graph signal processing (GSP) aims to develop tools for processing data defined on irregular graph domains. In this… Expand

Review

2018

Review

2018

In decentralized optimization, nodes cooperate to minimize an overall objective function that is the sum (or average) of per-node… Expand

Highly Cited

2010

Highly Cited

2010

Restricted Boltzmann machines were developed using binary stochastic hidden units. These can be generalized by replacing each… Expand

Highly Cited

2004

Highly Cited

2004

In this paper, we discuss consensus problems for networks of dynamic agents with fixed and switching topologies. We analyze three… Expand

Highly Cited

2003

Highly Cited

2003

Introduction to Graphs Fundamentals of Graph Theory, Jonathan L. Gross and Jay Yellen Families of Graphs and Digraphs, Lowell W… Expand

Highly Cited

1993

Highly Cited

1993

Relational methods can be found at various places in computer science, notably in data base theory, relational semantics on… Expand

Highly Cited

1974

Highly Cited

1974

From the Publisher:
With this text, you gain an understanding of the fundamental concepts of algorithms, the very heart of… Expand

Highly Cited

1959

Highly Cited

1959

We consider n points (nodes), some or all pairs of which are connected by a branch; the length of each branch is given. We… Expand