135 search results - page 18 / 27 » Hardness of cut problems in directed graphs |
96
Voted
MOBICOM
2012
ACM
12 years 12 months ago
2012
ACM
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
145
click to vote
BVAI
2007
Springer
15 years 3 months ago
2007
Springer
We tested the efficiency of category learning when participants are provided only with pairs of objects, known to belong either to the same class (Positive Equivalence Constraints ...
SARA
2009
Springer
15 years 4 months ago
2009
Springer
We study novel approaches for solving of hard combinatorial problems by translation to Boolean Satisfiability (SAT). Our focus is on combinatorial problems that can be represented...
88
Voted
ECCV
2010
Springer
15 years 2 months ago
2010
Springer
Maintaining the stability of tracks on multiple targets in video over extended time periods remains a challenging problem. A few methods which have recently shown encouraging resul...
IPPS
1996
IEEE
15 years 1 months ago
1996
IEEE
Many irregular scientific computing problems can be modeled by directed acyclic task graphs (DAGs). In this paper, we present an efficient run-time system for executing general as...