2304 search results - page 309 / 461 » On the Vulnerability of Large Graphs |
102
click to vote
GRAPHITE
2005
ACM
15 years 6 months ago
2005
ACM
We present a novel method to create perpetual animations from a small set of given keyframes. Existing approaches either are limited to re-sequencing large amounts of existing ima...
135
Voted
ESWS
2008
Springer
15 years 2 months ago
2008
Springer
Integrated access to multiple distributed and autonomous RDF data sources is a key challenge for many semantic web applications. As a reaction to this challenge, SPARQL, the W3C Re...
124
Voted
NIPS
2007
15 years 2 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
118
Voted
UAI
2008
15 years 2 months ago
2008
We generalize Shimizu et al's (2006) ICA-based approach for discovering linear non-Gaussian acyclic (LiNGAM) Structural Equation Models (SEMs) from causally sufficient, conti...
118
Voted
KAIS
2008
15 years 24 days ago
2008
Abstract. Quantitative Association Rule (QAR) mining has been recognized an influential research problem over the last decade due to the popularity of quantitative databases and th...