13214 search results - page 2378 / 2643 » Pseudorandomness for network algorithms |
186
click to vote
GECCO
2005
Springer
16 years 7 days ago
2005
Springer
In medical research, being able to justify decisions is generally as important as taking the right ones. Interpretability is then one of the chief characteristics a learning algor...
175
click to vote
ICANN
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. To generalize the Fisher Discriminant Analysis (FDA) algorithm to the case of discriminant functions belonging to a nonlinear, finite dimensional function space F (Nonli...
187
click to vote
ICDT
2005
ACM
16 years 7 days ago
2005
ACM
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
166
click to vote
IWQOS
2005
Springer
16 years 6 days ago
2005
Springer
Most congestion control algorithms try to emulate processor sharing (PS) by giving each competing flow an equal share of a bottleneck link. This approach leads to fairness, and pr...
168
Voted
WAOA
2005
Springer
16 years 5 days ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...