116 search results - page 18 / 24 » Beyond Graphs: A New Synthesis. |
193
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
Many computer vision applications rely on the efficient optimization of challenging, so-called non-submodular, binary pairwise MRFs. A promising graph cut based approach for optim...
125
click to vote
DATE
1997
IEEE
15 years 10 months ago
1997
IEEE
List scheduling algorithms attempt to minimize latency under resource constraints using a priority list. We propose a new heuristic that can be used in conjunction with any priori...
185
click to vote
ISPDC
2005
IEEE
15 years 11 months ago
2005
IEEE
Abstract— In this article, we propose a fully distributed algorithm for finding all primes in an given interval [2..n] (or (L, R), more generally), based on the SMER — Schedul...
171
click to vote
KDD
2010
ACM
15 years 8 months ago
2010
ACM
Influence maximization, defined by Kempe, Kleinberg, and Tardos (2003), is the problem of finding a small set of seed nodes in a social network that maximizes the spread of influe...
180
click to vote
PST
2008
15 years 7 months ago
2008
This paper presents a new personal data access control (PDAC) scheme that is inspired by the protection schemes practiced in communities for sharing valuable commodities. The PDAC...