Sciweavers

1081 search results - page 156 / 217
» Working with the LR Degrees
Sort
View
CDC
2010
IEEE
107views Control Systems» more  CDC 2010»
13 years 6 months ago
Probabilistic mutual localization in multi-agent systems from anonymous position measures
Abstract-- Recent research on multi-agent systems has produced a plethora of decentralized controllers that implicitly assume various degrees of agent localization. However, many p...
Antonio Franchi, Giuseppe Oriolo, Paolo Stegagno
CORR
2011
Springer
159views Education» more  CORR 2011»
13 years 6 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
CORR
2011
Springer
186views Education» more  CORR 2011»
13 years 6 months ago
On the Complexity of Solving a Bivariate Polynomial System
We study the complexity of computing the real solutions of a bivariate polynomial system using the recently proposed algorithm Bisolve [3]. Bisolve is a classical elimination metho...
Pavel Emeliyanenko, Michael Sagraloff
FI
2011
146views more  FI 2011»
13 years 6 months ago
A Service Oriented Architecture for Personalized Universal Media Access
: Multimedia streaming means delivering continuous data to a plethora of client devices. Besides the actual data transport, this also needs a high degree of content adaptation resp...
Sascha Tönnies, Benjamin Köhncke, Patric...
JCSS
2011
95views more  JCSS 2011»
13 years 5 months ago
Hardness results for approximating the bandwidth
The bandwidth of an n-vertex graph G is the minimum value b such that the vertices of G can be mapped to distinct integer points on a line without any edge being stretched to a di...
Chandan K. Dubey, Uriel Feige, Walter Unger