4255 search results - page 80 / 851 » Cover |
168
click to vote
SWAT
2004
Springer
16 years 22 days ago
2004
Springer
The standard dynamic programming solution to finding k-medians on a line with n nodes requires O(kn2 ) time. Dynamic programming speedup techniques, e.g., use of the quadrangle i...
223
Voted
WAOA
2004
Springer
16 years 22 days ago
2004
Springer
157
Voted
WIA
2004
Springer
16 years 22 days ago
2004
Springer
Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
148
Voted
ICALP
2003
Springer
16 years 18 days ago
2003
Springer