Sciweavers

IPL
2010
65views more  IPL 2010»
13 years 10 months ago
Multicasting in the hypercube, chord and binomial graphs
We discuss multicasting for the n-cube network and its close variants, the Chord and the Binomial Graph (BNG) Network. We present simple transformations and proofs that establish ...
Christopher C. Cipriano, Teofilo F. Gonzalez
IPL
2010
69views more  IPL 2010»
13 years 10 months ago
A simple representation of subwords of the Fibonacci word
We introduce a representation of subwords of the infinite Fibonacci word f∞ by a specific concatenation of finite Fibonacci words. It is unique and easily computable by backwa...
Bartosz Walczak
IPL
2010
66views more  IPL 2010»
13 years 10 months ago
There is no EPTAS for two-dimensional knapsack
Ariel Kulik, Hadas Shachnai
IPL
2010
75views more  IPL 2010»
13 years 10 months ago
A new analysis of the false positive rate of a Bloom filter
Kenneth J. Christensen, Allen Roginsky, Miguel Jim...
IPL
2010
72views more  IPL 2010»
13 years 10 months ago
A local decision test for sparse polynomials
Elena Grigorescu, Kyomin Jung, Ronitt Rubinfeld
IPL
2010
65views more  IPL 2010»
13 years 10 months ago
A network flow based approach for network selection in dynamic spectrum access networks
Santhanakrishnan Anand, Rajarathnam Chandramouli
IPL
2010
94views more  IPL 2010»
13 years 10 months ago
Finding frequent items over sliding windows with constant update time
Regant Y. S. Hung, Lap-Kei Lee, Hing-Fung Ting
IPL
2010
114views more  IPL 2010»
13 years 10 months ago
Alphabetic coding with exponential costs
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
Michael B. Baer
IPL
2010
247views more  IPL 2010»
13 years 10 months ago
The Floyd-Warshall algorithm on graphs with negative cycles
The Floyd-Warshall algorithm is a simple and widely used algorithm to compute shortest paths between all pairs of vertices in an edge weighted directed graph. It can also be used ...
Stefan Hougardy
IPL
2010
160views more  IPL 2010»
13 years 10 months ago
Antimagic labeling and canonical decomposition of graphs
An antimagic labeling of a connected graph with m edges is an injective assignment of labels from {1, . . . , m} to the edges such that the sums of incident labels are distinct at...
Michael D. Barrus