Results 1 - 10 of 20,153

Automating the Design of Graphical Presentations of Relational Information

by Jock Mackinlay - ACM Transactions on Graphics , 1986
"... The goal of the research described in this paper is to develop an application-independent presentation tool that automatically designs effective graphical presentations (such as bar charts, scatter plots, and connected graphs) of relational information. Two problems are raised by this goal: The codi ..."
Abstract - Cited by 559 (9 self) - Add to MetaCart
The goal of the research described in this paper is to develop an application-independent presentation tool that automatically designs effective graphical presentations (such as bar charts, scatter plots, and connected graphs) of relational information. Two problems are raised by this goal

GPS-Less Low Cost Outdoor Localization for Very Small Devices.

by Nirupama Bulusu , John Heidemann , Deborah Estrin - IEEE Personal Communications Magazine, , 2000
"... Abstract-Instrumenting the physical world through large networks of wireless sensor nodes, particularly for applications like environmental monitoring of water and soil, requires that these nodes be very small, light, untethered and unobtrusive. The problem of localization, i.e., determining where ..."
Abstract - Cited by 1000 (27 self) - Add to MetaCart
in these networks. In this paper, we review localization techniques and evaluate the effectiveness of a very simple connectivity-metric method for localization in outdoor environments that makes use of the inherent radio-frequency (RF) communications capabilities of these devices. A fixed number of reference points

Authoritative Sources in a Hyperlinked Environment

by Jon M. Kleinberg - JOURNAL OF THE ACM , 1999
"... The network structure of a hyperlinked environment can be a rich source of information about the content of the environment, provided we have effective means for understanding it. We develop a set of algorithmic tools for extracting information from the link structures of such environments, and repo ..."
Abstract - Cited by 3632 (12 self) - Add to MetaCart
The network structure of a hyperlinked environment can be a rich source of information about the content of the environment, provided we have effective means for understanding it. We develop a set of algorithmic tools for extracting information from the link structures of such environments

Consensus and cooperation in networked multi-agent systems

by Reza Olfati-Saber , J Alex Fax , Richard M Murray , Reza Olfati-Saber , J Alex Fax , Richard M Murray - Proceedings of the IEEE , 2007
"... Summary. This paper provides a theoretical framework for analysis of consensus algorithms for multi-agent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node failures, time-delays, and performance guarantees. An ove ..."
Abstract - Cited by 807 (4 self) - Add to MetaCart
. An overview of basic concepts of information consensus in networks and methods of convergence and performance analysis for the algorithms are provided. Our analysis framework is based on tools from matrix theory, algebraic graph theory, and control theory. We discuss the connections between consensus problems

Consensus Problems in Networks of Agents with Switching Topology and Time-Delays

by Reza Olfati Saber, Richard M. Murray , 2003
"... In this paper, we discuss consensus problems for a network of dynamic agents with fixed and switching topologies. We analyze three cases: i) networks with switching topology and no time-delays, ii) networks with fixed topology and communication time-delays, and iii) max-consensus problems (or leader ..."
Abstract - Cited by 1112 (21 self) - Add to MetaCart
leader determination) for groups of discrete-time agents. In each case, we introduce a linear/nonlinear consensus protocol and provide convergence analysis for the proposed distributed algorithm. Moreover, we establish a connection between the Fiedler eigenvalue of the information flow in a network (i

Algebraic Graph Theory

by Chris Godsil, Mike Newman , 2011
"... Algebraic graph theory comprises both the study of algebraic objects arising in connection with graphs, for example, automorphism groups of graphs along with the use of algebraic tools to establish interesting properties of combinatorial objects. One of the oldest themes in the area is the investiga ..."
Abstract - Cited by 892 (13 self) - Add to MetaCart
provides useful restrictions on the underlying combinatorial object. Thus in coding theory we look for codes that are as large as possible, since such codes are most effective in transmitting information over noisy channels. The theory of association schemes provides the most effective means

No Free Lunch Theorems for Optimization

by David H. Wolpert, et al. , 1997
"... A framework is developed to explore the connection between effective optimization algorithms and the problems they are solving. A number of “no free lunch ” (NFL) theorems are presented which establish that for any algorithm, any elevated performance over one class of problems is offset by performan ..."
Abstract - Cited by 961 (10 self) - Add to MetaCart
A framework is developed to explore the connection between effective optimization algorithms and the problems they are solving. A number of “no free lunch ” (NFL) theorems are presented which establish that for any algorithm, any elevated performance over one class of problems is offset

Taming the Underlying Challenges of Reliable Multihop Routing in Sensor Networks

by Alec Woo, Terence Tong, David Culler - In SenSys , 2003
"... The dynamic and lossy nature of wireless communication poses major challenges to reliable, self-organizing multihop networks. These non-ideal characteristics are more problematic with the primitive, low-power radio transceivers found in sensor networks, and raise new issues that routing protocols mu ..."
Abstract - Cited by 781 (20 self) - Add to MetaCart
must address. Link connectivity statistics should be captured dynamically through an efficient yet adaptive link estimator and routing decisions should exploit such connectivity statistics to achieve reliability. Link status and routing information must be maintained in a neighborhood table

Laplacian eigenmaps and spectral techniques for embedding and clustering.

by Mikhail Belkin , Partha Niyogi - Proceeding of Neural Information Processing Systems, , 2001
"... Abstract Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami op erator on a manifold , and the connections to the heat equation , we propose a geometrically motivated algorithm for constructing a representation for data sampled from a low dimensional manifold embedded in ..."
Abstract - Cited by 668 (7 self) - Add to MetaCart
in a higher dimensional space. The algorithm provides a computationally efficient approach to nonlinear dimensionality reduction that has locality preserving properties and a natural connection to clustering. Several applications are considered. In many areas of artificial intelligence, information

Optimizing Search Engines using Clickthrough Data

by Thorsten Joachims , 2002
"... This paper presents an approach to automatically optimizing the retrieval quality of search engines using clickthrough data. Intuitively, a good information retrieval system should present relevant documents high in the ranking, with less relevant documents following below. While previous approaches ..."
Abstract - Cited by 1314 (23 self) - Add to MetaCart
This paper presents an approach to automatically optimizing the retrieval quality of search engines using clickthrough data. Intuitively, a good information retrieval system should present relevant documents high in the ranking, with less relevant documents following below. While previous
Results 1 - 10 of 20,153