316 search results - page 48 / 64 » On almost self-complementary graphs |
KDD
2009
ACM
16 years 8 days ago
2009
ACM
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
107
click to vote
PLDI
2004
ACM
15 years 5 months ago
2004
ACM
Pointer analysis is a critical problem in optimizing compiler, parallelizing compiler, software engineering and most recently, hardware synthesis. While recent efforts have sugges...
107
click to vote
INFOCOM
2011
IEEE
14 years 3 months ago
2011
IEEE
Abstract—WiFi-enabled buses and stops may form the backbone of a metropolitan delay tolerant network, that exploits nearby communications, temporary storage at stops, and predict...
230
click to vote
COMPGEOM
2011
ACM
14 years 3 months ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
102
click to vote
CGI
2004
IEEE
15 years 3 months ago
2004
IEEE
In this paper, we propose a new method that can consistently orient all normals of any mesh (if at all possible), while ensuring that most polygons are seen with their front-faces...