Sciweavers

1143 search results - page 78 / 229
» pairing 2007
Sort
View
CORR
2007
Springer
111views Education» more  CORR 2007»
13 years 10 months ago
Link Scheduling in STDMA Wireless Networks: A Line Graph Approach
—We consider point to point link scheduling in Spatial Time Division Multiple Access (STDMA) wireless networks under the physical interference model. We propose a novel link sche...
N. Praneeth Kumar, Ashutosh Deepak Gore, Abhay Kar...
DCG
2007
86views more  DCG 2007»
13 years 10 months ago
Ball-Polyhedra
We study two notions. One is that of spindle convexity. A set of circumradius not greater than one is spindle convex if, for any pair of its points, it contains every short circula...
Károly Bezdek, Zsolt Langi, Márton N...
ENDM
2007
93views more  ENDM 2007»
13 years 10 months ago
Measurable sets with excluded distances
For a set of distances D = {d1, . . . , dk} a set A is called D-avoiding if no pair of points of A is at distance di for some i. We show that the density of A is exponentially sma...
Boris Bukh
FFA
2007
85views more  FFA 2007»
13 years 10 months ago
Ordinary abelian varieties having small embedding degree
Miyaji, Nakabayashi and Takano (MNT) gave families of group orders of ordinary elliptic curves with embedding degree suitable for pairing applications. In this paper we generalise ...
Steven D. Galbraith, James F. McKee, P. C. Valen&c...
EJC
2007
13 years 9 months ago
The structure of the 3-separations of 3-connected matroids II
The authors showed in an earlier paper that there is a tree that displays, up to a natural equivalence, all non-trivial 3-separations of a 3-connected matroid. The purpose of this ...
James G. Oxley, Charles Semple, Geoff Whittle