Sciweavers

1243 search results - page 40 / 249
» On the locality of bounded growth
Sort
View
INFOCOM
2008
IEEE
14 years 2 months ago
The Inframetric Model for the Internet
—A large amount of algorithms has recently been designed for the Internet under the assumption that the distance defined by the round-trip delay (RTT) is a metric. Moreover, man...
Pierre Fraigniaud, Emmanuelle Lebhar, Laurent Vien...
ICIP
2007
IEEE
14 years 2 months ago
Early Termination Algorithms for Correlation Coefficient Based Block Matching
Block based motion compensation techniques make frequent use of Early Termination Algorithms (ETA) to reduce the computational cost of block matching process. ETAs have been well ...
Arif Mahmood, Sohaib Khan
GECCO
2004
Springer
14 years 1 months ago
A Polynomial Upper Bound for a Mutation-Based Algorithm on the Two-Dimensional Ising Model
Abstract. Fitness functions based on the Ising model are suited excellently for studying the adaption capabilities of randomised search heuristics. The one-dimensional Ising model ...
Simon Fischer
DAGSTUHL
2008
13 years 9 months ago
Distributed Bounded-Error Parameter and State Estimation in Networks of Sensors
This paper presents distributed bounded-error parameter and state estimation algorithms suited to measurement processing by a network of sensors. Contrary to centralized estimation...
Michel Kieffer
CORR
2011
Springer
142views Education» more  CORR 2011»
12 years 11 months ago
On the Locality of Codeword Symbols
Consider a linear [n, k, d]q code C. We say that that i-th coordinate of C has locality r, if the value at this coordinate can be recovered from accessing some other r coordinates...
Parikshit Gopalan, Cheng Huang, Huseyin Simitci, S...