Results 1  10
of
751,419
On Estimating EndtoEnd Network Path Properties
, 1999
"... The more information about current network conditions available to a transport protocol, the more efficiently it can use the network to transfer its data. In networks such as the Internet, the transport protocol must often form its own estimates of network properties based on measurements performed ..."
Abstract

Cited by 244 (14 self)
 Add to MetaCart
by the connection endpoints. We consider two basic transport estimation problems: determining the setting of the retransmission timer (RTO) for a reliable protocol, and estimating the bandwidth available to a connection as it begins. We look at both of these problems in the context of TCP, using a large TCP
INEQUALITIES OF NORDHAUS–GADDUM TYPE FOR CONNECTED DOMINATION
"... Abstract. A set S of vertices of a graph G is a connected dominating set if every vertex not in S is adjacent to some vertex in S and the subgraph induced by S is connected. The connected domination number γc(G) is the minimum size of a connected dominating set of G. In this paper we prove that γc(G ..."
Abstract
 Add to MetaCart
(G)} + 2 if γc(G), γc(G) ≥ 4 and show that the bound is sharp when min{δ(G), δ(G)} = 6. Keywords: connected dominating set, connected domination number, NordhausGaddum inequalities. MSC 2000: 05C69
A Pattern Approach to Interaction Design
, 2000
"... To create successful interactive systems, user interface designers need to cooperate with developers and application domain experts in an interdisciplinary team. These groups, however, usually miss a common terminology to exchange ideas, opinions, and values. This paper presents an approach that use ..."
Abstract

Cited by 253 (13 self)
 Add to MetaCart
To create successful interactive systems, user interface designers need to cooperate with developers and application domain experts in an interdisciplinary team. These groups, however, usually miss a common terminology to exchange ideas, opinions, and values. This paper presents an approach that uses pattern languages to capture this knowledge in software development, HCI, and the application domain. A formal, domainindependent definition of design patterns allows for computer support without sacrificing readability, and pattern use is integrated into the usability engineering lifecycle. As an example, experience from building an awardwinning interactive music exhibit was turned into a pattern language, which was then used to inform followup projects and support HCI education.
inequality
, 2008
"... Existence, uniqueness, and a priori estimates for solutions are studied for stochastic parabolic Ito equations. An analog of the second fundamental inequality and the related existence theorem are obtained for backward stochastic parabolic Ito equation. ..."
Abstract
 Add to MetaCart
Existence, uniqueness, and a priori estimates for solutions are studied for stochastic parabolic Ito equations. An analog of the second fundamental inequality and the related existence theorem are obtained for backward stochastic parabolic Ito equation.
Inequality By
"... This article revisits neglected arguments of the Moynihan Report to yield insights for a contemporary understanding of racial inequality in American cities. The author argues that the logic of Moynihan’s reasoning implies three interlinked hypotheses: (1) the tangle of “pathology, ” or what today we ..."
Abstract
 Add to MetaCart
This article revisits neglected arguments of the Moynihan Report to yield insights for a contemporary understanding of racial inequality in American cities. The author argues that the logic of Moynihan’s reasoning implies three interlinked hypotheses: (1) the tangle of “pathology, ” or what today
AND INEQUALITY
"... Short extracts from this publication may be reproduced unaltered without authorization on condition that the source is indicated. For rights of reproduction or translation, application should be made to UNRISD, which welcomes such applications. The designations employed in this publication and the p ..."
Abstract
 Add to MetaCart
Short extracts from this publication may be reproduced unaltered without authorization on condition that the source is indicated. For rights of reproduction or translation, application should be made to UNRISD, which welcomes such applications. The designations employed in this publication and the presentation of material herein do not imply the expression of any opinion whatsoever on the part of UNRISD concerning the legal status of any country, territory, city or area or of its authorities, or concerning the delimitation of its frontiers or boundaries. UNRISD publication
On Weaklyconnected Domination in Graphs
"... Let G = (V, E) be a connected undirected graph. For any vertex v # V , the closed neighborhood of v is N [v] = {v} # { u # V  uv # E }. For S # V , the closed neighborhood of S is N [S] = S v#S N [v]. The subgraph weakly induced by S is #S# w = (N [S], E # (S × N [S])). A set ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
set S is a weaklyconnected dominating set of G if S is dominating and #S# w is connected. The weaklyconnected domination number is #w (G) = min{ S  S is a weaklyconnected dominating set of G }, and the upper weaklyconnected domination number is #w (G) = max{ S  S is a minimal weaklyconnected
Connected Domination of Regular Graphs
, 2008
"... A dominating set D of a graph G is a subset of V (G) such that for every vertex v ∈ V (G), either v ∈ D or there exists a vertex u ∈ D that is adjacent to v in G. Dominating sets of small cardinality are of interest. A connected dominating set C of a graph G is a dominating set of G such that the su ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A dominating set D of a graph G is a subset of V (G) such that for every vertex v ∈ V (G), either v ∈ D or there exists a vertex u ∈ D that is adjacent to v in G. Dominating sets of small cardinality are of interest. A connected dominating set C of a graph G is a dominating set of G
Results 1  10
of
751,419