1200 search results - page 19 / 240 » Marked Ancestor Problems |
173
click to vote
EMNLP
2007
15 years 6 months ago
2007
This paper proposes a tree kernel with contextsensitive structured parse tree information for relation extraction. It resolves two critical problems in previous tree kernels for r...
223
Voted
ALGORITHMICA
2011
15 years 3 days ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
155
click to vote
DEDS
2008
15 years 5 months ago
2008
This paper deals with the on-line monitoring of large systems modeled as Petri Nets under partial observation. The plant observation is given by a subset of transitions whose occu...
130
click to vote
ICAC
2005
IEEE
15 years 10 months ago
2005
IEEE
We present an architecture for and prototype of a system for quickly detecting software problem recurrences. Re-discovery of the same problem is very common in many large software...
160
Voted
CPAIOR
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. This paper introduces a problem called the temporal knapsack problem, presents several algorithms for solving it, and compares their performance. The temporal knapsack pr...