3946 search results - page 28 / 790 » The computational complexity of choice sets |
106
click to vote
TVCG
2012
13 years 2 months ago
2012
—The Morse-Smale complex is a useful topological data structure for the analysis and visualization of scalar data. This paper describes an algorithm that processes all mesh eleme...
128
click to vote
TCS
2010
14 years 10 months ago
2010
We consider a graph-theoretical formalization of the process of gene assembly in ciliates introduced in Ehrenfeucht et al (2003), where a gene is modeled as a signed graph. The ge...
CSCWD
2008
Springer
15 years 1 months ago
2008
Springer
Design is a complex process often described as a collaboration between a designer and herself. In architectural design, a designer must consider the selection of a subset of actio...
APL
1998
ACM
15 years 4 months ago
1998
ACM
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. T...
100
click to vote
ALGOSENSORS
2004
Springer
15 years 5 months ago
2004
Springer
Determining the positions of the sensor nodes in a network is essential to many network functionalities such as routing, coverage and tracking, and event detection. The localizatio...