Results 1  10
of
6,547,535
Books in graphs
, 2008
"... A set of q triangles sharing a common edge is called a book of size q. We write β (n, m) for the the maximal q such that every graph G (n, m) contains a book of size q. In this note 1) we compute β ( n, cn 2) for infinitely many values of c with 1/4 < c < 1/3, 2) we show that if m ≥ (1/4 − α) ..."
Abstract

Cited by 2380 (22 self)
 Add to MetaCart
A set of q triangles sharing a common edge is called a book of size q. We write β (n, m) for the the maximal q such that every graph G (n, m) contains a book of size q. In this note 1) we compute β ( n, cn 2) for infinitely many values of c with 1/4 < c < 1/3, 2) we show that if m ≥ (1/4 − α
RealTime Systems
, 2000
"... Collision avoidance is an important topic in multirobot systems. Existing multirobot pathfinding approaches ignore sideswipe collisions among robots (i.e., only consider the collision which two agents try to occupy the same node during the same timestep) [1, 3, 4], and allow diagonal move between ..."
Abstract

Cited by 590 (11 self)
 Add to MetaCart
between robots R1 and R2 in the situation depicted in Figure 1(a), but also that in Figure 1(b), which is typically not considered as a collision in existing multirobot systems. (a) (b) (c) Figure 2: Illustration of deadloop. The green square and the red square are the robot positions and the goal
Modular elliptic curves and Fermat’s Last Theorem
 ANNALS OF MATH
, 1995
"... When Andrew John Wiles was 10 years old, he read Eric Temple Bell’s The Last Problem and was so impressed by it that he decided that he would be the first person to prove Fermat’s Last Theorem. This theorem states that there are no nonzero integers a, b, c, n with n> 2 such that a n + b n = c n ..."
Abstract

Cited by 612 (1 self)
 Add to MetaCart
When Andrew John Wiles was 10 years old, he read Eric Temple Bell’s The Last Problem and was so impressed by it that he decided that he would be the first person to prove Fermat’s Last Theorem. This theorem states that there are no nonzero integers a, b, c, n with n> 2 such that a n + b n = c
From SHIQ and RDF to OWL: The Making of a Web Ontology Language
 Journal of Web Semantics
, 2003
"... The OWL Web Ontology Language is a new formal language for representing ontologies in the Semantic Web. OWL has features from several families of representation languages, including primarily Description Logics and frames. OWL also shares many characteristics with RDF, the W3C base of the Semantic W ..."
Abstract

Cited by 621 (44 self)
 Add to MetaCart
The OWL Web Ontology Language is a new formal language for representing ontologies in the Semantic Web. OWL has features from several families of representation languages, including primarily Description Logics and frames. OWL also shares many characteristics with RDF, the W3C base of the Semantic
KodairaSpencer theory of gravity and exact results for quantum string amplitudes
 Commun. Math. Phys
, 1994
"... We develop techniques to compute higher loop string amplitudes for twisted N = 2 theories with ĉ = 3 (i.e. the critical case). An important ingredient is the discovery of an anomaly at every genus in decoupling of BRST trivial states, captured to all orders by a master anomaly equation. In a particu ..."
Abstract

Cited by 545 (60 self)
 Add to MetaCart
We develop techniques to compute higher loop string amplitudes for twisted N = 2 theories with ĉ = 3 (i.e. the critical case). An important ingredient is the discovery of an anomaly at every genus in decoupling of BRST trivial states, captured to all orders by a master anomaly equation. In a
Design and Evaluation of a WideArea Event Notification Service
 ACM Transactions on Computer Systems
"... This paper presents SIENA, an event notification service that we have designed and implemented to exhibit both expressiveness and scalability. We describe the service's interface to applications, the algorithms used by networks of servers to select and deliver event notifications, and the strat ..."
Abstract

Cited by 789 (32 self)
 Add to MetaCart
, and the strategies used Effort sponsored by the Defense Advanced Research Projects Agency, and Air Force Research Laboratory, Air Force Materiel Command,USAF, under agreement numbers F3060294C0253, F3060297 20021, F306029820163, F3060299C0174, F306020020608, and N66001008945; by the Air Force Office
Ktheory for operator algebras
 Mathematical Sciences Research Institute Publications
, 1998
"... p. XII line5: since p. 12: I blew this simple formula: should be α = −〈ξ, η〉/〈η, η〉. p. 2 I.1.1.4: The RieszFischer Theorem is often stated this way today, but neither Riesz nor Fischer (who worked independently) phrased it in terms of completeness of the orthogonal system {e int}. If [a, b] is a ..."
Abstract

Cited by 559 (0 self)
 Add to MetaCart
space is not σfinite. p. 13: add after I.2.6.16: I.2.6.17. If X is a compact subset of C not containing 0, and k ∈ N, there is in general no bound on the norm of T −1 as T ranges over all operators with ‖T ‖ ≤ k and σ(T) ⊆ X. For example, let Sn ∈ L(l 2) be the truncated shift: Sn(α1, α2,...) = (0
Measuring individual differences in implicit cognition: The implicit association test
 J PERSONALITY SOCIAL PSYCHOL 74:1464–1480
, 1998
"... An implicit association test (IAT) measures differential association of 2 target concepts with an attribute. The 2 concepts appear in a 2choice task (e.g., flower vs. insect names), and the attribute in a 2nd task (e.g., pleasant vs. unpleasant words for an evaluation attribute). When instructions ..."
Abstract

Cited by 937 (63 self)
 Add to MetaCart
An implicit association test (IAT) measures differential association of 2 target concepts with an attribute. The 2 concepts appear in a 2choice task (e.g., flower vs. insect names), and the attribute in a 2nd task (e.g., pleasant vs. unpleasant words for an evaluation attribute). When instructions
Understanding packet delivery performance in dense wireless sensor networks
, 2003
"... Wireless sensor networks promise finegrain monitoring in a wide variety of environments. Many of these environments (e.g., indoor environments or habitats) can be harsh for wireless communication. From a networking perspective, the most basic aspect of wireless communication is the packet delivery ..."
Abstract

Cited by 656 (15 self)
 Add to MetaCart
different environments:an indoor office building, a habitat with moderate foliage, and an open parking lot. Our findings have interesting implications for the design and evaluation of routing and mediumaccess protocols for sensor networks. Categories and Subject Descriptors C.2.1 [Network Architecture
Critical Power for Asymptotic Connectivity in Wireless Networks
, 1998
"... : In wireless data networks each transmitter's power needs to be high enough to reach the intended receivers, while generating minimum interference on other receivers sharing the same channel. In particular, if the nodes in the network are assumed to cooperate in routing each others ' pack ..."
Abstract

Cited by 548 (19 self)
 Add to MetaCart
as the number of nodes in the network goes to infinity. It is shown that if n nodes are placed in a disc of unit area in ! 2 and each node transmits at a power level so as to cover an area of ßr 2 = (log n + c(n))=n, then the resulting network is asymptotically connected with probability one if and only
Results 1  10
of
6,547,535