Sciweavers

7773 search results - page 160 / 1555
» On generalized Frame-Stewart numbers
Sort
View
119
Voted
HSNMC
2004
Springer
172views Multimedia» more  HSNMC 2004»
15 years 3 months ago
Fast Update Algorithm for IP Forwarding Table Using Independent Sets
This paper describes a new update algorithm for Internet Protocol (IP) forwarding tables. The update algorithm is so general that it can be combined with many IP address lookup alg...
Xuehong Sun, Sartaj K. Sahni, Yiqiang Q. Zhao
ICALP
2004
Springer
15 years 3 months ago
Learning a Hidden Subgraph
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
Noga Alon, Vera Asodi
ICALP
2004
Springer
15 years 3 months ago
A Note on Karr's Algorithm
We give a simple formulation of Karr’s algorithm for computing all affine relationships in affine programs. This simplified algorithm runs in time O(nk3 ) where n is the progr...
Markus Müller-Olm, Helmut Seidl
KELSI
2004
Springer
15 years 3 months ago
A Randomized Algorithm for Distance Matrix Calculations in Multiple Sequence Alignment
Multiple sequence alignment (MSA) is a vital problem in biology. Optimal alignment of multiple sequences becomes impractical even for a modest number of sequences [1] since the gen...
Sanguthevar Rajasekaran, Vishal Thapar, Hardik Dav...
WG
2004
Springer
15 years 3 months ago
Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters
It has long been known that the number of spanning trees in circulant graphs with fixed jumps and n nodes satisfies a recurrence relation in n. The proof of this fact was algebra...
Mordecai J. Golin, Yiu-Cho Leung