Sciweavers

1983 search results - page 122 / 397
» Competitive graph searches
Sort
View
APVIS
2007
13 years 9 months ago
Using eye tracking to investigate graph layout effects
Graphs are typically visualized as node-link diagrams. Although there is a fair amount of research focusing on crossing minimization to improve readability, little attention has b...
Weidong Huang
KDD
2009
ACM
245views Data Mining» more  KDD 2009»
14 years 8 months ago
Mining rich session context to improve web search
User browsing information, particularly their non-search related activity, reveals important contextual information on the preferences and the intent of web users. In this paper, ...
Guangyu Zhu, Gilad Mishne
ADBIS
2007
Springer
117views Database» more  ADBIS 2007»
14 years 2 months ago
Improving the Performance of M-Tree Family by Nearest-Neighbor Graphs
The M-tree and its variants have been proved to provide an efficient similarity search in database environments. In order to further improve their performance, in this paper we pro...
Tomás Skopal, David Hoksza
CIMCA
2005
IEEE
14 years 1 months ago
A Hybrid Estimation of Distribution Algorithm for the Minimal Switching Graph Problem
Minimal Switching Graph (MSG) is a graphical model for the constrained via minimization problem — a combinatorial optimization problem in integrated circuit design automation. F...
Maolin Tang, Raymond Y. K. Lau
MKM
2004
Springer
14 years 1 months ago
A Graph-Based Approach Towards Discerning Inherent Structures in a Digital Library of Formal Mathematics
As the amount of online formal mathematical content grows, for example through active efforts such as the Mathweb [21], MOWGLI [4], Formal Digital Library, or FDL [1], and others, ...
Lori Lorigo, Jon M. Kleinberg, Richard Eaton, Robe...