Sciweavers

54 search results - page 3 / 11
» Navigation in degree of interest trees
Sort
View
COMBINATORICA
2010
13 years 3 months ago
A randomized embedding algorithm for trees
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...
Benny Sudakov, Jan Vondrák
ICALP
2011
Springer
12 years 9 months ago
Compact Navigation and Distance Oracles for Graphs with Small Treewidth
Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k, we consider the problem of preprocessing the graph to bui...
Arash Farzan, Shahin Kamali
CHI
2006
ACM
14 years 6 months ago
An evaluation of pan & zoom and rubber sheet navigation with and without an overview
We present a study that evaluates conventional Pan and Zoom Navigation and Rubber Sheet Navigation, a rectilinear Focus+Context technique. Each of the two navigation techniques wa...
Dmitry Nekrasovski, Adam Bodnar, Joanna McGrenere,...
FLAIRS
2001
13 years 7 months ago
A Practical Markov Chain Monte Carlo Approach to Decision Problems
Decisionand optimizationproblemsinvolvinggraphsarise in manyareas of artificial intelligence, including probabilistic networks, robot navigation, and network design. Manysuch prob...
Timothy Huang, Yuriy Nevmyvaka
SIGMOD
2007
ACM
198views Database» more  SIGMOD 2007»
14 years 6 months ago
Addressing diverse user preferences in SQL-query-result navigation
Database queries are often exploratory and users often find their queries return too many answers, many of them irrelevant. Existing work either categorizes or ranks the results t...
Zhiyuan Chen, Tao Li