Sciweavers

243 search results - page 34 / 49
» Interactive Search Refinement Techniques for HARD Tasks
Sort
View
CHI
2005
ACM
14 years 7 months ago
QueryLines: approximate query for visual browsing
We introduce approximate query techniques for searching and analyzing two-dimensional data sets such as line or scatter plots. Our techniques allow users to explore a dataset by d...
Kathy Ryall, Neal Lesh, Tom Lanning, Darren Leigh,...
CIKM
2006
Springer
13 years 11 months ago
Evaluation by comparing result sets in context
Familiar evaluation methodologies for information retrieval (IR) are not well suited to the task of comparing systems in many real settings. These systems and evaluation methods m...
Paul Thomas, David Hawking
GD
2005
Springer
14 years 1 months ago
Visualizing Graphs as Trees: Plant a Seed and Watch it Grow
TreePlus is a graph browsing technique based on a tree-style layout. It shows the missing graph structure using interaction techniques and enables users to start with a specific no...
Bongshin Lee, Cynthia Sims Parr, Catherine Plaisan...
SYNASC
2005
IEEE
110views Algorithms» more  SYNASC 2005»
14 years 1 months ago
Performance Tuning of Evolutionary Algorithms Using Particle Sub Swarms
Particle Swarm Optimization (PSO) technique proved its ability to deal with very complicated optimization and search problems. This paper proposes a new particle swarm variant whi...
Crina Grosan, Ajith Abraham, Monica Nicoara
CHI
1997
ACM
13 years 11 months ago
Effective View Navigation
Searching for an item in a long ordered list is a frequent task when using any kind of computing device (from desktop PCs to mobile phones). This paper explores three different int...
George W. Furnas