Sciweavers

2463 search results - page 197 / 493
» Rankings of Directed Graphs
Sort
View
106
Voted
STACS
2004
Springer
15 years 9 months ago
On Minimum Circular Arrangement
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
Murali K. Ganapathy, Sachin Lodha
140
Voted
SIGIR
2003
ACM
15 years 9 months ago
Implicit link analysis for small web search
Current Web search engines generally impose link analysis-based re-ranking on web-page retrieval. However, the same techniques, when applied directly to small web search such as i...
Gui-Rong Xue, Hua-Jun Zeng, Zheng Chen, Wei-Ying M...
144
Voted
FUZZIEEE
2007
IEEE
15 years 10 months ago
Learning Undirected Possibilistic Networks with Conditional Independence Tests
—Approaches based on conditional independence tests are among the most popular methods for learning graphical models from data. Due to the predominance of Bayesian networks in th...
Christian Borgelt
132
Voted
MFCS
2007
Springer
15 years 9 months ago
Hardness Results for Tournament Isomorphism and Automorphism
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
Fabian Wagner
123
Voted
ISCAS
2005
IEEE
147views Hardware» more  ISCAS 2005»
15 years 9 months ago
A heuristic approach for multiple restricted multiplication
— This paper introduces a heuristic solution to the multiple restricted multiplication (MRM) optimization problem. MRM refers to a situation where a single variable is multiplied...
Nalin Sidahao, George A. Constantinides, Peter Y. ...