5350 search results - page 260 / 1070 » Space and time in eco-ontologies |
220
click to vote
STOC
1996
ACM
15 years 10 months ago
1996
ACM
We use the Laplacian and power method to compute Betti numbers of simplicial complexes. This has a number of advantages over other methods, both in theory and in practice. It requ...
164
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the...
159
click to vote
INTERACT
2003
15 years 8 months ago
2003
The Fly's Eye project (2002) creates an animated document of both space and time and draws inspiration from the structure, function and significance of the eye of the fly and...
154
click to vote
ICGA
2007
15 years 6 months ago
2007
In 1989, an effort to solve the game of checkers began. It was naïve because of the daunting size of the search space, 5×1020 positions, and because of computer capabilities of ...
185
click to vote
TCS
2010
15 years 5 months ago
2010
We give an O(n2 m + nm2 + m2 log m) time and O(n2 + m2 ) space algorithm for finding the shortest traveling salesman tour through the vertices of two simple polygonal obstacles i...