Sciweavers

1376 search results - page 154 / 276
» Searching Trees: An Essay
Sort
View
ICRA
2010
IEEE
159views Robotics» more  ICRA 2010»
15 years 4 months ago
An RRT-based path planner for use in trajectory imitation
We propose a more robust robot programming by demonstration system planner that produces a reproduction path which satisfies statistical constraints derived from demonstration traj...
Jonathan Claassens
SIGCSE
2012
ACM
310views Education» more  SIGCSE 2012»
14 years 2 months ago
CSTutor: a pen-based tutor for data structure visualization
We present CSTutor, a sketch-based interface designed to help students understand data structures. It currently supports Linked Lists, Binary Search Trees, AVL Trees, and Heaps, a...
Sarah Buchanan, Brandon Ochs, Joseph J. LaViola Jr...
GD
2003
Springer
15 years 11 months ago
Fixed Parameter Algorithms for one-sided crossing minimization Revisited
We exhibit a small problem kernel for the one-sided crossing minimization problem. This problem plays an important role in graph drawing algorithms based on the Sugiyama layering ...
Vida Dujmovic, Henning Fernau, Michael Kaufmann
CORR
2010
Springer
145views Education» more  CORR 2010»
15 years 6 months ago
Random Indexing K-tree
Random Indexing K-tree is the combination of two algorithms suited for large scale document clustering. Keywords Random Indexing, K-tree, Dimensionality Reduction, B-tree, Search T...
Christopher M. De Vries, Lance De Vine, Shlomo Gev...
TCIAIG
2010
15 years 1 months ago
Evaluating Root Parallelization in Go
Abstract--Parallelizing Monte-Carlo tree search has been considered to be a way to improve the strength of computer Go programs. In this paper, we analyze the performance of two ro...
Yusuke Soejima, Akihiro Kishimoto, Osamu Watanabe