2252 search results - page 199 / 451 » Lower Bounds for Dynamic Algorithms |
170
Voted
PODC
2010
ACM
15 years 7 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
122
Voted
SIAMSC
2008
15 years 3 months ago
2008
This paper discusses both the theoretical and statistical errors obtained by various well-known dot products, from the canonical to pairwise algorithms, and introduces a new and mo...
129
Voted
ICPR
2000
IEEE
16 years 4 months ago
2000
IEEE
This paper presents an algorithm, called the winnerupdate algorithm, for accelerating the nearest neighbor search. By constructing a hierarchical structure ,for each feature point...
134
click to vote
GLOBECOM
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— For MIMO broadcast systems the effects of shadowing on the channel capacity and the fairness of the system in sharing the resources amongst multiple users are important...
129
Voted
COLT
1994
Springer
15 years 7 months ago
1994
Springer
: Sequential algorithms given by Angluin 1987 and Schapire 1992 learn deterministic nite automata DFA exactly from Membership and Equivalence queries. These algorithms are feasible...