13603 search results - page 187 / 2721 » On the Complexity of Computing Treelength |
135
click to vote
SOFSEM
2009
Springer
16 years 1 months ago
2009
Springer
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
152
click to vote
STACS
2009
Springer
15 years 11 months ago
2009
Springer
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...
132
click to vote
IWPEC
2009
Springer
15 years 11 months ago
2009
Springer
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cyl...
128
click to vote
CSR
2006
Springer
15 years 8 months ago
2006
Springer
We classify the computational complexity of all constraint satisfaction problems where the constraint language is preserved by all permutations of the domain. A constraint languag...
121
click to vote
PRICAI
2000
Springer
15 years 8 months ago
2000
Springer
The automated prediction of a user's interests and requirements is an area of interest to the Artificial Intelligence community. However, current predictive statistical approa...