163 search results - page 8 / 33 » Improving the Context-sensitive Dependency Graph |
ICDE
2012
IEEE
11 years 10 months ago
2012
IEEE
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
IWIA
2005
IEEE
14 years 1 months ago
2005
IEEE
Intrusion detection systems alert the system administrators of intrusions but, in most cases, do not provide details about which system events are relevant to the intrusion and ho...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
ACL
2009
13 years 5 months ago
2009
Dependency parsers show syntactic relations between words using a directed graph, but comparing dependency parsers is difficult because of differences in theoretical models. We de...
DSD
2009
IEEE
14 years 2 months ago
2009
IEEE
—As CMOS process technology advances towards 32nm, SoC complexity continuously grows but its dependability significantly decreases. In this paper, a beamforming chip 1 is designe...