Sciweavers

2957 search results - page 299 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
MOR
2006
95views more  MOR 2006»
15 years 6 months ago
An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
In multicriteria optimization, several objective functions, conflicting with each other, have to be minimized simultaneously. We propose a new efficient method for approximating t...
Jörg Fliege
CN
2002
102views more  CN 2002»
15 years 6 months ago
On the impact of soft handoff in cellular systems
We present a model for soft handoff in wireless cellular networks. In such networks, due to overlapping cells, handoffs are not instantaneous and multiple channels may be occupied...
Nidhi Hegde, Khosrow Sohraby
DAM
2011
15 years 1 months ago
Noisy colored point set matching
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...
Yago Diez, Joan Antoni Sellarès
IACR
2011
124views more  IACR 2011»
14 years 6 months ago
Zero-Correlation Linear Cryptanalysis of Block Ciphers
Linear cryptanalysis, along with differential cryptanalysis, is an important tool to evaluate the security of block ciphers. This work introduces a novel extension of linear crypt...
Andrey Bogdanov, Vincent Rijmen
ICLP
2009
Springer
16 years 7 months ago
Preprocessing for Optimization of Probabilistic-Logic Models for Sequence Analysis
Abstract. A class of probabilistic-logic models is considered, which increases the expressibility from HMM's and SCFG's regular and contextfree languages to, in principle...
Henning Christiansen, Ole Torp Lassen