Sciweavers

654 search results - page 54 / 131
» Matrix Graph Grammars
Sort
View
118
Voted
STOC
2004
ACM
109views Algorithms» more  STOC 2004»
16 years 4 months ago
Approximating the cut-norm via Grothendieck's inequality
The cut-norm ||A||C of a real matrix A = (aij)iR,jS is the maximum, over all I R, J S of the quantity | iI,jJ aij|. This concept plays a major role in the design of efficient app...
Noga Alon, Assaf Naor
122
Voted
JMLR
2010
132views more  JMLR 2010»
14 years 10 months ago
On the Impact of Kernel Approximation on Learning Accuracy
Kernel approximation is commonly used to scale kernel-based algorithms to applications containing as many as several million instances. This paper analyzes the effect of such appr...
Corinna Cortes, Mehryar Mohri, Ameet Talwalkar
135
Voted
VIZSEC
2005
Springer
15 years 9 months ago
Multiple Coordinated Views for Network Attack Graphs
While efficient graph-based representations have been developed for modeling combinations of low-level network attacks, relatively little attention has been paid to effective tech...
Steven Noel, Michael Jacobs, Pramod Kalapa, Sushil...
171
Voted
ICDAR
2011
IEEE
14 years 3 months ago
Subgraph Spotting through Explicit Graph Embedding: An Application to Content Spotting in Graphic Document Images
—We present a method for spotting a subgraph in a graph repository. Subgraph spotting is a very interesting research problem for various application domains where the use of a re...
Muhammad Muzzamil Luqman, Jean-Yves Ramel, Josep L...
137
Voted
VLC
2008
132views more  VLC 2008»
15 years 3 months ago
Enforced generative patterns for the specification of the syntax and semantics of visual languages
We present the new notion of enforced generative pattern, a structure that declares positive or negative conditions that must be satisfied by a model. Patterns are applied to tran...
Paolo Bottoni, Esther Guerra, Juan de Lara