13603 search results - page 379 / 2721 » On the Complexity of Computing Treelength |
228
click to vote
COMPGEOM
2011
ACM
14 years 11 months ago
2011
ACM
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...
203
click to vote
CIE
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. If L is a finite relational language then all computable Lstructures can be effectively enumerated in a sequence {An}n∈ω in such a way that for every computable L-st...
204
Voted
CIE
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...
222
click to vote
SC
2005
ACM
16 years 1 months ago
2005
ACM
The development of complex scientific applications for high-end systems is a challenging task. Addressing complexity of the involved software and algorithms is becoming increasing...
189
click to vote
EH
2005
IEEE
16 years 1 months ago
2005
IEEE
The Evolvable Computation Group, at NASA’s Jet Propulsion Laboratory, is tasked with demonstrating the utility of computational engineering and computer optimized design for com...