123 search results - page 21 / 25 » Complexity of Boolean Functions on PRAMs - Lower Bound Techn... |
RT
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. We present a new data structure for encoding the appearance of a geometric model as seen from a viewing region (view cell). This representation can be used in interactive...
EMSOFT
2004
Springer
14 years 24 days ago
2004
Springer
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
ISBI
2009
IEEE
14 years 2 months ago
2009
IEEE
Biological images have the potential to reveal complex signatures that may not be amenable to morphological modeling in terms of shape, location, texture, and color. An effective ...
TIT
1998
13 years 7 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...
ICMS
2010
13 years 6 months ago
2010
There is a growing interest in numeric-algebraic techniques in the computer algebra community as such techniques can speed up many applications. This paper is concerned with one su...