Sciweavers

68 search results - page 12 / 14
» Open Graphs and Monoidal Theories
Sort
View
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
13 years 11 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
CORR
2010
Springer
69views Education» more  CORR 2010»
13 years 7 months ago
Epistemic irrelevance in credal nets: the case of imprecise Markov trees
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal ne...
Gert de Cooman, Filip Hermans, Alessandro Antonucc...
JEI
2007
144views more  JEI 2007»
13 years 7 months ago
Cost-based closed-contour representations
This paper presents an efficient technique for linking edge points in order to generate a closed-contour representation. It is based on the consecutive use of global and local sch...
Angel Domingo Sappa, Boris Xavier Vintimilla
ISI
2010
Springer
13 years 5 months ago
Social media and social reality
Social Media provide an exciting and novel view into social phenomena. The vast amounts of data that can be gathered from the Internet coupled with massively parallel supercomputer...
William N. Reynolds, Marta S. Weber, Robert M. Far...
JCDL
2011
ACM
272views Education» more  JCDL 2011»
12 years 10 months ago
CollabSeer: a search engine for collaboration discovery
Collaborative research has been increasingly popular and important in academic circles. However, there is no open platform available for scholars or scientists to effectively dis...
Hung-Hsuan Chen, Liang Gou, Xiaolong Zhang, Clyde ...