Sciweavers

7827 search results - page 1257 / 1566
» time 2007
Sort
View
215
Voted
WAIFI
2007
Springer
175views Mathematics» more  WAIFI 2007»
16 years 1 months ago
Attacking the Filter Generator over GF (2 m )
We consider the filter generator over GF(2m ) consisting of a linear feedback shift register of length k that generates a maximal length linear sequence of period 2mk − 1 over G...
Sondre Rønjom, Tor Helleseth
WAIM
2007
Springer
16 years 1 months ago
Building Data Synopses Within a Known Maximum Error Bound
The constructions of Haar wavelet synopses for large data sets have proven to be useful tools for data approximation. Recently, research on constructing wavelet synopses with a gua...
Chaoyi Pang, Qing Zhang, David P. Hansen, Anthony ...
WAOA
2007
Springer
126views Algorithms» more  WAOA 2007»
16 years 1 months ago
Better Bounds for Incremental Medians
In the incremental version of the well-known k-median problem the objective is to compute an incremental sequence of facility sets F1 ⊆ F2 ⊆ .... ⊆ Fn, where each Fk contain...
Marek Chrobak, Mathilde Hurand
WDAG
2007
Springer
162views Algorithms» more  WDAG 2007»
16 years 1 months ago
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
Beat Gfeller, Nicola Santoro, Peter Widmayer
WEA
2007
Springer
117views Algorithms» more  WEA 2007»
16 years 1 months ago
Better Landmarks Within Reach
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F....
« Prev « First page 1257 / 1566 Last » Next »