Institution
ETH Zurich
Education•Zurich, Switzerland•
About: ETH Zurich is a education organization based out in Zurich, Switzerland. It is known for research contribution in the topics: Population & Computer science. The organization has 48393 authors who have published 122408 publications receiving 5111383 citations. The organization is also known as: Swiss Federal Institute of Technology in Zurich & Eidgenössische Technische Hochschule Zürich.
Topics: Population, Computer science, Catalysis, Context (language use), Laser
Papers published on a yearly basis
Papers
More filters
••
TL;DR: In this article, the concept of adaptive submodularity is introduced, which generalizes submodular set functions to adaptive policies and provides performance guarantees for both stochastic maximization and coverage, and can be exploited to speed up the greedy algorithm by using lazy evaluations.
Abstract: Many problems in artificial intelligence require adaptively making a sequence of decisions with uncertain outcomes under partial observability. Solving such stochastic optimization problems is a fundamental but notoriously difficult challenge. In this paper, we introduce the concept of adaptive submodularity, generalizing submodular set functions to adaptive policies. We prove that if a problem satisfies this property, a simple adaptive greedy algorithm is guaranteed to be competitive with the optimal policy. In addition to providing performance guarantees for both stochastic maximization and coverage, adaptive submodularity can be exploited to drastically speed up the greedy algorithm by using lazy evaluations. We illustrate the usefulness of the concept by giving several examples of adaptive submodular objectives arising in diverse AI applications including management of sensing resources, viral marketing and active learning. Proving adaptive submodularity for these problems allows us to recover existing results in these applications as special cases, improve approximation guarantees and handle natural generalizations.
570 citations
••
24 May 2004TL;DR: This paper provides a concise and intuitive definition of interference and shows that most currently proposed topology control algorithms do not effectively constrain interference and proposes connectivity-preserving an spanner constructions that are interference-minimal.
Abstract: Topology control in ad-hoc networks tries to lower node energy consumption by reducing transmission power and by confining interference, collisions and consequently retransmissions. Commonly low interference is claimed to be a consequence to sparseness of the resulting topology. In this paper we disprove this implication. In contrast to most of the related work claiming to solve the interference issue by graph sparseness without providing clear argumentation or proofs, we provide a concise and intuitive definition of interference. Based on this definition we show that most currently proposed topology control algorithms do not effectively constrain interference. Furthermore we propose connectivity-preserving an spanner constructions that are interference-minimal.
569 citations
••
01 Apr 2013TL;DR: This research examines the use of pseudonymity in the Bitcoin network, and the role that it plays in the development of trust and confidence in the system.
Abstract: Bitcoin is quickly emerging as a popular digital payment system. However, in spite of its reliance on pseudonyms, Bitcoin raises a number of privacy concerns due to the fact that all of the transactions that take place are publicly announced in the system.
569 citations
••
TL;DR: The research is categorized into three areas: motivations of open source software contributors; governance, organization, and the process of innovation in open source Software projects; and competitive dynamics enforced by open sourceSoftware.
Abstract: Breaking with many established assumptions about how innovation ought to work, open source software projects offer eye-opening examples of novel innovation practices for students and practitioners in many fields. In this article we briefly review existing research on the open source phenomenon and discuss the utility of open source software research findings for many other fields. We categorize the research into three areas: motivations of open source software contributors; governance, organization, and the process of innovation in open source software projects; and competitive dynamics enforced by open source software. We introduce the articles in this special issue of Management Science on open source software, and show how each contributes insights to one or more of these areas.
568 citations
••
TL;DR: In this article, the authors studied the rheological requirements for printable concrete in terms of yield stress, viscosity, elastic modulus, critical strain, and structuration rate.
568 citations
Authors
Showing all 49062 results
Name | H-index | Papers | Citations |
---|---|---|---|
Ralph Weissleder | 184 | 1160 | 142508 |
Ruedi Aebersold | 182 | 879 | 141881 |
David L. Kaplan | 177 | 1944 | 146082 |
Andrea Bocci | 172 | 2402 | 176461 |
Richard H. Friend | 169 | 1182 | 140032 |
Lorenzo Bianchini | 152 | 1516 | 106970 |
David D'Enterria | 150 | 1592 | 116210 |
Andreas Pfeiffer | 149 | 1756 | 131080 |
Bernhard Schölkopf | 148 | 1092 | 149492 |
Martin J. Blaser | 147 | 820 | 104104 |
Sebastian Thrun | 146 | 434 | 98124 |
Antonio Lanzavecchia | 145 | 408 | 100065 |
Christoph Grab | 144 | 1359 | 144174 |
Kurt Wüthrich | 143 | 739 | 103253 |
Maurizio Pierini | 143 | 1782 | 104406 |