123 search results - page 22 / 25 » Enumerating Triangulation Paths |
EMNLP
2007
13 years 8 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...
ISOLA
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. The Implicit Path Enumeration Technique (IPET) has become widely accepted as a powerful technique to compute upper bounds on the Worst-Case Execution Time (WCET) of time-...
COMBINATORICA
2011
12 years 7 months ago
2011
The topological Tverberg theorem states that for any prime power q and continuous map from a (d + 1)(q − 1)-simplex to Rd , there are q disjoint faces Fi of the simplex whose im...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—We introduce a novel protection scheme, called Cooperative Fast Protection (CFP), to fight against a single link failure in survivable WDM (Wavelength Division Multiplexing) mes...
COCOON
2009
Springer
14 years 1 months ago
2009
Springer
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...