6110 search results - page 230 / 1222 » Approximate Computing |
190
click to vote
CLUSTER
2001
IEEE
15 years 10 months ago
2001
IEEE
Given the increasing traffic on the World Wide Web (Web), it is difficult for a single popular Web server to handle the demand from its many clients. By clustering a group of Web ...
185
click to vote
PODC
2012
ACM
13 years 9 months ago
2012
ACM
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
145
click to vote
CSFW
2010
IEEE
15 years 10 months ago
2010
IEEE
—Quantitative information-flow analysis (QIF) is an emerging technique for establishing information-theoretic confidentiality properties. Automation of QIF is an important step...
184
click to vote
PAMI
2007
15 years 6 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
188
click to vote
PARA
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. This paper presents a method of solving initial value problems using Euler’s method, based on the domain of interval valued functions of a real variable. In contrast to...