1319 search results - page 192 / 264 » Recursive Random Fields |
116
click to vote
FOCS
1999
IEEE
15 years 7 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
122
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
123
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...
123
click to vote
TMC
2008
15 years 2 months ago
2008
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
163
click to vote
CAIP
2009
Springer
15 years 26 days ago
2009
Springer
This paper describes a method for seamless enlargement or editing of difficult colour textures containing simultaneously both regular periodic and stochastic components. Such textu...