1819 search results - page 81 / 364 » Computability and Representations of the Zero Set |
160
click to vote
VIS
2007
IEEE
16 years 7 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...
154
click to vote
ACL
2001
15 years 7 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...
185
click to vote
CONIELECOMP
2004
IEEE
15 years 10 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...
172
click to vote
GECCO
2005
Springer
15 years 11 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...
137
click to vote
ECSQARU
2007
Springer
16 years 11 days 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, ...