Sciweavers

1110 search results - page 48 / 222
» New Approximation Results for Resource Replication Problems
Sort
View
ADHOCNOW
2008
Springer
15 years 5 months ago
Approximating Minimum-Power k-Connectivity
Abstract. The Minimum-Power k-Connected Subgraph (MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (su...
Zeev Nutov
IACR
2011
141views more  IACR 2011»
13 years 11 months ago
Approximate common divisors via lattices
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
Henry Cohn, Nadia Heninger
NPL
1998
175views more  NPL 1998»
14 years 11 months ago
Prediction of Chaotic Time-Series with a Resource-Allocating RBF Network
Abstract. One of the main problems associated with arti cial neural networks online learning methods is the estimation of model order. In this paper, we report about a new approach...
Roman Rosipal, Milos Koska, Igor Farkas
SIAMSC
2008
167views more  SIAMSC 2008»
14 years 11 months ago
New Finite Elements for Large-Scale Simulation of Optical Waves
We present a new method to simulate optical waves in large geometries. This method is based on newly developed finite elements, so-called Trigonometric Finite Wave Elements (TFWEs)...
Britta Heubeck, Christoph Pflaum, Gunther Steinle
BMCBI
2010
117views more  BMCBI 2010»
14 years 11 months ago
New decoding algorithms for Hidden Markov Models using distance measures on labellings
Background: Existing hidden Markov model decoding algorithms do not focus on approximately identifying the sequence feature boundaries. Results: We give a set of algorithms to com...
Daniel G. Brown 0001, Jakub Truszkowski