Sciweavers

605 search results - page 23 / 121
» Visual Analogy in Problem Solving
Sort
View
COGSCI
2010
234views more  COGSCI 2010»
13 years 7 months ago
High Regularities in Eye-Movement Patterns Reveal the Dynamics of the Visual Working Memory Allocation Mechanism
With only two to five slots of visual working memory (VWM), humans are able to quickly solve complex visual problems to near optimal solutions. To explain the paradox between tigh...
Xiaohui Kong, Christian D. Schunn, Garrick L. Wall...
IEEEVAST
2010
13 years 2 months ago
A continuous analysis process between desktop and collaborative visual analytics environments
Since its inception, the field of visual analytics has undergone tremendous growth in understanding how to create interactive visual tools to solve analytical problems. However, w...
Dong Hyun Jeong, Evan A. Suma, Thomas Butkiewicz, ...
ICPR
2008
IEEE
14 years 2 months ago
Birkhoff polytopes, heat kernels and graph complexity
In this paper we use doubly stochastic matrices to establish a link between Birkhoff polytopes and heat kernels on graphs. Based on this analysis we construct a multi-dimensional ...
Francisco Escolano, Edwin R. Hancock, Miguel Angel...
PR
2006
115views more  PR 2006»
13 years 7 months ago
Visual surveillance by dynamic visual attention method
This paper describes a method for visual surveillance based on biologically motivated dynamic visual attention in video image sequences. Our system is based on the extraction and ...
María T. López, Antonio Ferná...
JDA
2006
83views more  JDA 2006»
13 years 7 months ago
Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by del...
Takehiro Ito, Xiao Zhou, Takao Nishizeki