1172 search results - page 161 / 235 » Constructions of generalized Sidon sets |
174
click to vote
SIAMCOMP
2000
15 years 6 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
138
click to vote
SIAMCO
2002
15 years 6 months ago
2002
Abstract. We consider feasible sets given by conic constraints, where the cone defining the constraints is convex with nonempty interior. We study the case where the feasible set i...
147
click to vote
ML
2007
ACM
15 years 6 months ago
2007
ACM
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
142
click to vote
SPAA
1990
ACM
15 years 10 months ago
1990
ACM
A wad-free implementation of a data object in shared memory is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execu...
162
click to vote
CHI
2010
ACM
15 years 9 months ago
2010
ACM
Constructive emotional experiences are strongly related to effective learning. Yet, it is challenging for teachers, researchers and students alike to understand the emotions exper...