1819 search results - page 81 / 364 » Computability and Representations of the Zero Set |
VIS
2007
IEEE
15 years 11 months ago
2007
IEEE
The Morse-Smale complex is an efficient representation of the gradient behavior of a scalar function, and critical points paired by the complex identify topological features and th...
ACL
2001
14 years 11 months ago
2001
In a headed tree, each terminal word can be uniquely labeled with a governing word and grammatical relation. This labeling is a summary of a syntactic analysis which eliminates de...
100
click to vote
CONIELECOMP
2004
IEEE
15 years 1 months ago
2004
IEEE
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...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Any computational approach to design, including the use of evolutionary algorithms, requires the transformation of the domain-specific knowledge into a formal design representatio...
ECSQARU
2007
Springer
15 years 4 months ago
2007
Springer
The binary representation is widely used for representing focal sets of Dempster-Shafer belief functions because it allows to compute efficiently all relevant operations. However, ...