Sciweavers

694 search results - page 97 / 139
» Open Graphs and Computational Reasoning
Sort
View
133
Voted
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
15 years 7 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
120
Voted
STACS
1997
Springer
15 years 6 months ago
Methods and Applications of (MAX, +) Linear Algebra
Exotic semirings such as the “(max, +) semiring” (R ∪ {−∞}, max, +), or the “tropical semiring” (N ∪ {+∞}, min, +), have been invented and reinvented many times s...
Stephane Gaubert, Max Plus
111
Voted
FOCS
2004
IEEE
15 years 6 months ago
The Hardness of Metric Labeling
The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels a...
Julia Chuzhoy, Joseph Naor
124
Voted
ISVC
2010
Springer
15 years 1 months ago
Subversion Statistics Sifter
We present Subversion Statistics Sifter, a visualisation and statistics system for exploring the structure and evolution of data contained in Subversion repositories with respect t...
Christoph Müller, Guido Reina, Michael Burch,...
129
Voted
ACL
2012
13 years 5 months ago
A Comparison of Chinese Parsers for Stanford Dependencies
Stanford dependencies are widely used in natural language processing as a semanticallyoriented representation, commonly generated either by (i) converting the output of a constitu...
Wanxiang Che, Valentin I. Spitkovsky, Ting Liu