33 search results - page 6 / 7 » Multiply-intersecting families revisited |
SMILE
1998
Springer
13 years 11 months ago
1998
Springer
We revisit the bilinear matching constraint between two perspective views of a 3D scene. Our objective is to represent the constraint in the same manner and form as the trilinear ...
DCOSS
2006
Springer
13 years 11 months ago
2006
Springer
We consider the problem of data propagation in wireless sensor networks and revisit the family of mixed strategy routing schemes. We show that maximizing the lifespan, balancing th...
CISS
2007
IEEE
13 years 9 months ago
2007
IEEE
— In this paper, we present a simple technique to approximate the performance union bound of a punctured turbo code. The bound approximation exploits only those terms of the tran...
CAGD
2010
13 years 7 months ago
2010
A Kokotsakis mesh is a polyhedral structure consisting of an n-sided central polygon P0 surrounded by a belt of polygons in the following way: Each side ai of P0 is shared by an a...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The algorithms in the current sequential numerical linear algebra libraries (e.g. LAPACK) do not parallelize well on multicore architectures. A new family of algorithms, the tile a...