Sciweavers

501 search results - page 56 / 101
» Methods for true power minimization
Sort
View
LICS
1999
IEEE
13 years 12 months ago
First-Order Logic vs. Fixed-Point Logic in Finite Set Theory
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...
Albert Atserias, Phokion G. Kolaitis
EGITALY
2006
13 years 9 months ago
Implementing mesh-based approaches for deformable objects on GPU
These latest years witnessed an impressive improvement of graphics hardware both in terms of features and in terms of computational power. This improvement can be easily observed ...
Guido Ranzuglia, Paolo Cignoni, Fabio Ganovelli, R...
ACL
1998
13 years 9 months ago
Conditions on Consistency of Probabilistic Tree Adjoining Grammars
Much of the power of probabilistic methods in modelling language comes from their ability to compare several derivations for the same string in the language. An important starting...
Anoop Sarkar
CGF
2010
149views more  CGF 2010»
13 years 7 months ago
Over Two Decades of Integration-Based, Geometric Flow Visualization
With ever increasing computing power, it is possible to process ever more complex fluid simulations. However, a gap between data set sizes and our ability to visualize them remain...
Tony McLoughlin, Robert S. Laramee, Ronald Peikert...
ICASSP
2011
IEEE
12 years 11 months ago
Automatic target classification in SAR images using MPCA
Multilinear analysis provides a powerful mathematical framework for analyzing synthetic aperture radar (SAR) images resulting from the interaction of multiple factors like sky lum...
Tristan Porges, Gérard Favier