Sciweavers

1163 search results - page 153 / 233
» Embedding into Bipartite Graphs
Sort
View
IPL
2008
80views more  IPL 2008»
13 years 8 months ago
Path partitions of hypercubes
A path partition of a graph G is a set of vertex-disjoint paths that cover all vertices of G. Given a set P = {{ai, bi}}m i=1 of pairs of distinct vertices of the n-dimensional hy...
Petr Gregor, Tomás Dvorák
CORR
2007
Springer
144views Education» more  CORR 2007»
13 years 8 months ago
Distributing the Kalman Filter for Large-Scale Systems
This paper derives a near optimal distributed Kalman filter to estimate a large-scale random field monitored by a network of N sensors. The field is described by a sparsely con...
Usman A. Khan, José M. F. Moura
JCO
2006
126views more  JCO 2006»
13 years 8 months ago
Combinatorics of TCP reordering
We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic from [7], that incorporates information on both arrival times, and the dynamics of packet IDs...
Anders Hansson, Gabriel Istrate, Shiva Prasad Kasi...
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 6 months ago
Efficiently Discovering Hammock Paths from Induced Similarity Networks
ty networks are important abstractions in many information management applications such as recommender systems, corpora analysis, and medical informatics. For instance, in a recom...
M. Shahriar Hossain, Michael Narayan, Naren Ramakr...
CORR
2011
Springer
159views Education» more  CORR 2011»
13 years 3 months ago
Scalable constructions of fractional repetition codes in distributed storage systems
Abstract—In distributed storage systems built using commodity hardware, it is necessary to store multiple replicas of every data chunk in order to ensure system reliability. In s...
Joseph C. Koo, John T. Gill III