Let G= (V, E) be a graph with p vertices and q edges. A graph G={V, E} with p vertices and q edges is said to be a Permutation labelling graph if there exists a bijection function f from set of all vertice G( ) to {1, 2,3... }p such that the induced edge labelling function h E G N : ( ) → is...

In this paper, we show that using multiple models when executing a specific task almost unavoidably gives rise to interaction between them, especially when their number is large. We show that this interaction can lead to biased and incomplete results if treated inappropriately (which we believe...

We apply a machine-learning algorithm calibrated from general human vision to predict visual salience of parts of a stock price series. We hypothesize that visual salience of adjacent prices increases decision weights on returns computed from those prices. We analyze the inferred decision impact...

In many domains we have witnessed the need to search a large entity-relation graph for direct and indirect relationships between a set of entities specified in a query. A search result, called a semantic association (SA), is typically a compact (e.g., diameter-constrained) connected subgraph...