Sciweavers

3055 search results - page 320 / 611
» Randomized Search Trees
Sort
View
SIGCSE
2012
ACM
310views Education» more  SIGCSE 2012»
13 years 11 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...
113
Voted
GD
2003
Springer
15 years 8 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
120
Voted
TCIAIG
2010
14 years 10 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
138
Voted
WWW
2010
ACM
15 years 10 months ago
Optimal rare query suggestion with implicit user feedback
Query suggestion has been an effective approach to help users narrow down to the information they need. However, most of existing studies focused on only popular/head queries. Si...
Yang Song, Li-wei He
103
Voted
ICIP
2006
IEEE
15 years 9 months ago
MRF Modeling for Optical Flow Computation from Multi-Structure Objects
We propose in this paper a new formulation of the equation of the optical flow enabling to compute global and local motions of multi-structure objects (flowers and petals, trees...
Véronique Prinet, Cyril Cassisa, FengFeng T...