724 search results - page 95 / 145 » Practical Performance of Efficient Minimum Cut Algorithms |
143
click to vote
CLOUD
2010
ACM
15 years 8 months ago
2010
ACM
This work addresses the need for stateful dataflow programs that can rapidly sift through huge, evolving data sets. These data-intensive applications perform complex multi-step c...
189
click to vote
JCO
2006
15 years 3 months ago
2006
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...
127
click to vote
DCC
2002
IEEE
16 years 2 months ago
2002
IEEE
This contribution is concerned with a generalization of Itoh and Tsujii's algorithm for inversion in extension fields GF(qm ). Unlike the original algorithm, the method introd...
127
click to vote
COOPIS
2004
IEEE
15 years 6 months ago
2004
IEEE
In application server systems, such as J2EE, replication is an essential strategy for reliability and efficiency. Many J2EE implementations, both commercial and open-source, provid...
139
click to vote
VEE
2005
ACM
15 years 8 months ago
2005
ACM
Modern transactional response-time sensitive applications have run into practical limits on the size of garbage collected heaps. The heap can only grow until GC pauses exceed the ...