Sciweavers

3955 search results - page 381 / 791
» Comparing the Power of Robots
Sort
View
ENTCS
2008
91views more  ENTCS 2008»
15 years 4 months ago
Towards Concrete Syntax Patterns for Logic-based Transformation Rules
Logic meta-programming in Prolog is a powerful way to express program analysis and transformation. However, its use can be difficult and error-prone because it requires programmer...
Malte Appeltauer, Günter Kniesel
TCOM
2008
117views more  TCOM 2008»
15 years 4 months ago
Constant Envelope OFDM
This paper describes a transformation technique aimed at solving the peak-to-average power ratio (PAPR) problem associated with OFDM (orthogonal frequency-division multiplexing). C...
Steve C. Thompson, Ahsen U. Ahmed, John G. Proakis...
CGF
2005
167views more  CGF 2005»
15 years 4 months ago
Adaptive Deformable Models for Graphics and Vision
Deformable models are a powerful tool in both computer graphics and computer vision. The description and implementation of the deformations have to be simultaneously flexible and ...
Siome Goldenstein, Christian Vogler, Luiz Velho
TWC
2008
101views more  TWC 2008»
15 years 4 months ago
Adaptive generalized selection combining (A-GSC) receivers
We introduce an adaptive generalized selection combining (A-GSC) receiver that can be efficiently applied in diversity rich fading environments such as in ultra-wideband applicatio...
Athanasios S. Lioumpas, George K. Karagiannidis, T...
CSUR
2000
69views more  CSUR 2000»
15 years 4 months ago
The framework approach for constraint satisfaction
: Constraint satisfaction programming (CSP) is a powerful paradigm for solving complex combinatorial problems, which has gained a lot of attention recently. Putting the power of co...
Pierre Roy, Anne Liret, François Pachet