2314 search results - page 126 / 463 » Minimal Partitions of a Graph |
127
click to vote
SIAMNUM
2010
14 years 10 months ago
2010
In the solution of Fluid-Structure Interaction problems, partitioned procedures are modular algorithms that involve separate fluid and structure solvers, that interact, in an itera...
142
click to vote
CSE
2009
IEEE
15 years 1 months ago
2009
IEEE
Edges in social network graphs can model sensitive relationships. In this paper, we consider the problem of edges anonymity in graphs. We propose a probabilistic notion of edge ano...
118
click to vote
HPCA
2002
IEEE
16 years 4 months ago
2002
IEEE
We propose a low overhead, on-line memory monitoring scheme utilizing a set of novel hardware counters. The counters act like pressure gauges indicating the marginal gain in the n...
110
click to vote
DATE
2007
IEEE
15 years 10 months ago
2007
IEEE
Many embedded applications exist where decisions are made using sensitive information. A critical issue in such applications is to ensure that data is accessed only by authorized ...
107
click to vote
SC
2003
ACM
15 years 9 months ago
2003
ACM
We present a novel approach for decomposing contact/impact computations in which the mesh elements come in contact with each other during the course of the simulation. Effective d...