7006 search results - page 287 / 1402 » Approximation Algorithms |
105
click to vote
ICPR
2002
IEEE
16 years 4 months ago
2002
IEEE
We present a fast non-iterative method for approximating the leading eigenvector so as to render graph-spectral based grouping algorithms more efficient. The approximation is base...
148
click to vote
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...
126
click to vote
DLT
2003
15 years 5 months ago
2003
We present different techniques for reducing the number of states and transitions in nondeterministic automata. These techniques are based on the two preorders over the set of st...
135
Voted
ALT
2004
Springer
16 years 23 days ago
2004
Springer
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
106
click to vote
ICC
2009
IEEE
15 years 10 months ago
2009
IEEE
—A new variation of the Flow-Aware Networking (FAN) concept is presented in the paper. The proposed solution is based on the Approximate Fair Dropping algorithm and called by us ...