1517 search results - page 198 / 304 » Hardening Functions for Large Scale Distributed Computations |
157
click to vote
INFOCOM
2002
IEEE
15 years 9 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
143
click to vote
SIGMOD
1997
ACM
15 years 8 months ago
1997
ACM
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...
132
click to vote
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
Convex relaxations for continuous multilabel problems have attracted a lot of interest recently [1–5]. Unfortunately, in previous methods, the runtime and memory requirements sca...
274
click to vote
OL
2011
14 years 11 months ago
2011
We consider sequential quadratic programming (SQP) methods for solving constrained nonlinear programming problems. It is generally believed that SQP methods are sensitive to the a...
120
click to vote
DAC
2007
ACM
16 years 5 months ago
2007
ACM
We present an efficient technique for finding the mean and variance of the full-chip leakage of a candidate design, while considering logic-structures and both die-to-die and with...