Sciweavers

422 search results - page 71 / 85
» Shortest paths between shortest paths and independent sets
Sort
View
EMNLP
2007
13 years 10 months ago
Tree Kernel-Based Relation Extraction with Context-Sensitive Structured Parse Tree Information
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...
Guodong Zhou, Min Zhang, Dong-Hong Ji, Qiaoming Zh...
ENVSOFT
2006
76views more  ENVSOFT 2006»
13 years 8 months ago
LQGraph: A software package for optimizing connectivity in conservation planning
LQGraph implements methods for optimizing the connectivity of sites administered to protect biodiversity (a conservation area network). The methods are suitable for existing prote...
Trevon Fuller, Sahotra Sarkar
IJSNET
2006
170views more  IJSNET 2006»
13 years 8 months ago
Ordinal MDS-based localisation for wireless sensor networks
: There are various applications in wireless sensor networks which require knowing the relative or actual position of the sensor nodes. Over the past few years, there have been dif...
Vijayanth Vivekanandan, Vincent W. S. Wong
JEA
2006
83views more  JEA 2006»
13 years 8 months ago
Cache-Friendly implementations of transitive closure
In this paper we show cache-friendly implementations of the Floyd-Warshall algorithm for the All-Pairs ShortestPath problem. We first compare the best commercial compiler optimiza...
Michael Penner, Viktor K. Prasanna
DM
1998
95views more  DM 1998»
13 years 8 months ago
An Euler-type formula for median graphs
Let G be a median graph on n vertices and m edges and let k be the number of equivalence classes of the Djokovi´c’s relation Θ defined on the edge-set of G. Then 2n − m −...
Sandi Klavzar, Henry Martyn Mulder, Riste Skrekovs...