10392 search results - page 406 / 2079 » Introduction to Computer Science |
154
click to vote
RTA
2010
Springer
15 years 8 months ago
2010
Springer
We consider the problem of computing, out of a set C of trees and a rewrite system R, those trees in C that cannot be rewritten into a tree in C. We solve this problem for sets of ...
221
click to vote
CAD
2004
Springer
15 years 6 months ago
2004
Springer
: LOGO is a programming language incorporating turtle graphics, originally devised for teaching computing to young children in elementary and middle schools. Here we advocate the u...
192
click to vote
ESIAT
2009
IEEE
15 years 4 months ago
2009
IEEE
Comparing with the rapidly increasing acquiring technology for remotely sensed data, the data processing technologies have been following behind, especially in computing speed and ...
167
click to vote
ISVD
2007
IEEE
16 years 1 months ago
2007
IEEE
Many algorithms exist for computing the 3D Voronoi diagram, but in most cases they assume that the input is in general position. Because of the many degeneracies that arise in 3D ...
194
click to vote
WG
2005
Springer
16 years 9 days ago
2005
Springer
The Tutte polynomial is a notoriously hard graph invariant, and efficient algorithms for it are known only for a few special graph classes, like for those of bounded tree-width. Th...