828 search results - page 100 / 166 » Simplicial Powers of Graphs |
TON
2008
13 years 7 months ago
2008
Abstract--In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node fail...
CGF
1999
13 years 7 months ago
1999
We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to...
CODES
2010
IEEE
13 years 5 months ago
2010
IEEE
Synchronous Dataflow (SDF) is a powerful analysis tool for regular, cyclic, parallel task graphs. The behaviour of SDF graphs however is static and therefore not always able to ac...
ICIW
2009
IEEE
13 years 5 months ago
2009
IEEE
Web spamming, the practice of introducing artificial text and links into web pages to affect the results of searches, has been recognized as a major problem for search engines. Bu...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...