2638 search results - page 333 / 528 » Random Geometric Complexes |
186
click to vote
CGF
1999
15 years 6 months ago
1999
Light fields and Lumigraphs are capable of rendering scenes of arbitrary geometrical or illumination complexity in real time. They are thus interesting ways of interacting with bo...
199
click to vote
MST
2002
15 years 6 months ago
2002
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
159
click to vote
TIT
1998
15 years 6 months ago
1998
— The Godard or the constant modulus algorithm (CMA) is an effective technique for blind receiver design in communications. However, due to the complexity of the Constant Modulus...
156
click to vote
TVLSI
2002
15 years 6 months ago
2002
In this paper, we deal with arbitrarily shaped rectilinear module placement using the transitive closure graph (TCG) representation. The geometric meanings of modules are transpare...
167
click to vote
PR
2007
15 years 6 months ago
2007
In this paper, an evolutionary clustering technique is described that uses a new point symmetry-based distance measure. The algorithm is therefore able to detect both convex and n...