2252 search results - page 208 / 451 » Lower Bounds for Dynamic Algorithms |
144
click to vote
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
—More fundamental than IP lookups and packet classification in routers is the extraction of fields such as IP Dest and TCP Ports that determine packet forwarding. While parsing...
115
Voted
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
127
click to vote
ESA
2004
Springer
15 years 9 months ago
2004
Springer
We introduce a new stable minimum storage algorithm for merging that needs O(m log( n m + 1)) element comparisons, where m and n are the sizes of the input sequences with m ≤ n. ...
122
click to vote
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
148
Voted
MOBIHOC
2006
ACM
16 years 3 months ago
2006
ACM
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...