Sciweavers

7978 search results - page 249 / 1596
» Representation before computation
Sort
View
SIGGRAPH
1997
ACM
15 years 10 months ago
Progressive simplicial complexes
In this paper, we introduce the progressive simplicial complex (PSC) representation, a new format for storing and transmitting triangulated geometric models. Like the earlier prog...
Jovan Popovic, Hugues Hoppe
CONIELECOMP
2004
IEEE
15 years 10 months ago
Representing and Computing Some Configuration Properties for the n-Dimensional Orthogonal Pseudo-Polytopes
In this paper we present a set of formulations that describe some properties of the configurations that can represent the n-Dimensional Orthogonal PseudoPolytopes. Moreover, we de...
Antonio Aguilera, Ricardo Pérez-Aguila
COLING
1996
15 years 8 months ago
A Computational Model for Generating Referring Expressions in a Multilingual Application Domain
In this paper we analyse the problem of generating referring expressions in a multilingnal generation system that produces instructions on how to fill out pension forms. The model...
Elena Not
IJCAI
1993
15 years 8 months ago
A Computational Model of Tractable Reasoning - Taking Inspiration from Cognition
Polynomial time complexity is the usual ‘threshold’ for distinguishing the tractable from the intractable and it may seem reasonable to adopt this notion of tractability in th...
Lokendra Shastri
SIAMNUM
2010
87views more  SIAMNUM 2010»
15 years 1 months ago
A Note on the Computation of All Zeros of Simple Quaternionic Polynomials
Polynomials with quaternionic coefficients located on only one side of the powers (we call them simple polynomials) may have two different types of zeros: isolated and spherical ze...
Drahoslava Janovská, Gerhard Opfer