Sciweavers

1425 search results - page 163 / 285
» Beyond Dependency Graphs
Sort
View
EAAI
2007
135views more  EAAI 2007»
13 years 8 months ago
Automatic generation of explanations: AGE
Explaining how engineering devices work is important to students, engineers, and operators. In general, machine generated explanations have been produced from a particular perspec...
Silvia B. González-Brambila, Eduardo F. Mor...
SAC
2008
ACM
13 years 7 months ago
Selectivity estimation in spatial networks
Modern applications requiring spatial network processing pose many interesting query optimization challenges. In many cases, query processing depends on the corresponding graph si...
Eleftherios Tiakas, Apostolos N. Papadopoulos, Ale...
CAV
2011
Springer
216views Hardware» more  CAV 2011»
12 years 12 months ago
Malware Analysis with Tree Automata Inference
Abstract. The underground malware-based economy is flourishing and it is evident that the classical ad-hoc signature detection methods are becoming insufficient. Malware authors ...
Domagoj Babic, Daniel Reynaud, Dawn Song
APPROX
2009
Springer
126views Algorithms» more  APPROX 2009»
14 years 2 months ago
Improved Inapproximability Results for Maximum k-Colorable Subgraph
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 ...
Venkatesan Guruswami, Ali Kemal Sinop
GD
2005
Springer
14 years 1 months ago
Odd Crossing Number Is Not Crossing Number
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...