Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
5,386
Planning for fast connectivity updates
- In Proceedings 48th IEEE Symposium on Foundations of Computer Science (FOCS
, 2007
"... Understanding how a single edge deletion can affect the connectivity of a graph amounts to finding the graph bridges. But when faced with d> 1 deletions, can we establish as easily how the connectivity changes? When planning for an emergency, we want to understand the structure of our network ahe ..."
Abstract
-
Cited by 13 (0 self)
- Add to MetaCart
, the size of each component, and a fast oracle for answering connectivity queries in the updated graph. The initial representation is polynomial-time constructible. 1.
A fast learning algorithm for deep belief nets
- Neural Computation
, 2006
"... We show how to use “complementary priors ” to eliminate the explaining away effects that make inference difficult in densely-connected belief nets that have many hidden layers. Using complementary priors, we derive a fast, greedy algorithm that can learn deep, directed belief networks one layer at a ..."
Abstract
-
Cited by 970 (49 self)
- Add to MetaCart
We show how to use “complementary priors ” to eliminate the explaining away effects that make inference difficult in densely-connected belief nets that have many hidden layers. Using complementary priors, we derive a fast, greedy algorithm that can learn deep, directed belief networks one layer
Consensus and cooperation in networked multi-agent systems
- 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
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces
- IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION
, 1996
"... A new motion planning method for robots in static workspaces is presented. This method proceeds in two phases: a learning phase and a query phase. In the learning phase, a probabilistic roadmap is constructed and stored as a graph whose nodes correspond to collision-free configurations and whose edg ..."
Abstract
-
Cited by 1277 (120 self)
- Add to MetaCart
edges correspond to feasible paths between these configurations. These paths are computed using a simple and fast local planner. In the query phase, any given start and goal configurations of the robot are connected to two nodes of the roadmap; the roadmap is then searched for a path joining these two
Fast Connection Establishment in the DTM Gigabit Network
- In Proc. 5th IFIP Conference on High Performance Networks
, 1994
"... Dynamic synchronous Transfer Mode (DTM) is a new protocol suite based on synchronous fast circuit switching. The DTM network is based on bandwidth reservation and supports dynamic reallocation of bandwidth. It is designed to support real-time multimedia applications and high-speed computer communica ..."
Abstract
-
Cited by 5 (2 self)
- Add to MetaCart
communication. DTM uses a novel medium-access technique and provides a multicast connection-oriented service. In this paper, the connection establishment in the DTM network is discussed and a scheme for fast connection establishment is presented. The scheme allows for fast set-up of channels which results
Fast connected components algorithms for the erew pram
- SIAM J. Comput
, 1999
"... We present fast and ecient parallel algorithms for nding the connected components of an undirected graph. These algorithms run on the exclusive-read, exclusive-write (EREW) PRAM. On a graph with n vertices and m edges, our randomized algorithm runs in O(log n) time using (m+n 1+) = logn EREW process ..."
Abstract
-
Cited by 29 (3 self)
- Add to MetaCart
We present fast and ecient parallel algorithms for nding the connected components of an undirected graph. These algorithms run on the exclusive-read, exclusive-write (EREW) PRAM. On a graph with n vertices and m edges, our randomized algorithm runs in O(log n) time using (m+n 1+) = logn EREW
CATH -- a hierarchic classification of protein domain structures
- STRUCTURE
, 1997
"... Background: Protein evolution gives rise to families of structurally related proteins, within which sequence identities can be extremely low. As a result, structure-based classifications can be effective at identifying unanticipated relationships in known structures and in optimal cases function can ..."
Abstract
-
Cited by 470 (33 self)
- Add to MetaCart
can also be assigned. The ever increasing number of known protein structures is too large to classify all proteins manually, therefore, automatic methods are needed for fast evaluation of protein structures. Results: We present a semi-automatic procedure for deriving a novel hierarchical
On the Provision of a Fast Connect Facility in a Connection-Mode Transport Service
, 1994
"... this paper we investigate how such a fast connect facility can be added to a connection-mode transport service. Starting from the eXpress Transfer Protocol (XTP) which is at the origin of the concept, we analyse the High Speed Transport Service (HSTS) and study how it can be improved by the introduc ..."
Abstract
- Add to MetaCart
this paper we investigate how such a fast connect facility can be added to a connection-mode transport service. Starting from the eXpress Transfer Protocol (XTP) which is at the origin of the concept, we analyse the High Speed Transport Service (HSTS) and study how it can be improved
Unambiguous Device Identification and Fast Connection Setup
- in Bluetooth,” Proc. of the European Wireless 2002
, 2002
"... The paper addresses two problems of Bluetooth which arise in situations where a user device performs transactions with a specific server device out of a number of similar devices in the proximity, such as ticket machines or point-of-sales terminals. Firstly, the server that a connection should be se ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
The paper addresses two problems of Bluetooth which arise in situations where a user device performs transactions with a specific server device out of a number of similar devices in the proximity, such as ticket machines or point-of-sales terminals. Firstly, the server that a connection should
Core affect and the psychological construction of emotion
- Psychological Review
"... At the heart of emotion, mood, and any other emotionally charged event are states experienced as simply feeling good or bad, energized or enervated. These states—called core affect—influence reflexes, perception, cognition, and behavior and are influenced by many causes internal and external, but pe ..."
Abstract
-
Cited by 448 (0 self)
- Add to MetaCart
, but people have no direct access to these causal connections. Core affect can therefore be experienced as freefloating (mood) or can be attributed to some cause (and thereby begin an emotional episode). These basic processes spawn a broad framework that includes perception of the core
Results 1 - 10
of
5,386
