Sciweavers

4100 search results - page 511 / 820
» General Linear Cameras
Sort
View
ANOR
2002
77views more  ANOR 2002»
15 years 7 months ago
Conditional Median: A Parametric Solution Concept for Location Problems
Classical approaches to location problems are based on the minimization of the average distance (the median concept) or the minimization of the maximum distance (the center concept...
Wlodzimierz Ogryczak, Mariusz Zawadzki
180
Voted
ANOR
2002
88views more  ANOR 2002»
15 years 7 months ago
Multicriteria Semi-Obnoxious Network Location Problems (MSNLP) with Sum and Center Objectives
Locating a facility is often modeled as either the maxisum or the minisum problem, reflecting whether the facility is undesirable (obnoxious) or desirable. But many facilities are ...
Horst W. Hamacher, Martine Labbé, Stefan Ni...
197
Voted
CORR
2004
Springer
111views Education» more  CORR 2004»
15 years 7 months ago
Maximum-likelihood decoding of Reed-Solomon Codes is NP-hard
Maximum-likelihood decoding is one of the central algorithmic problems in coding theory. It has been known for over 25 years that maximum-likelihood decoding of general linear cod...
Venkatesan Guruswami, Alexander Vardy
DCC
2000
IEEE
15 years 7 months ago
Relating Differential Distribution Tables to Other Properties of of Substitution Boxes
Due to the success of differential and linear attacks on a large number of encryption algorithms, it is importanttoinvestigaterelationshipsamongvariouscryptographic, includingdiffe...
Xian-Mo Zhang, Yuliang Zheng, Hideki Imai
MOR
2000
162views more  MOR 2000»
15 years 7 months ago
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
Alok Baveja, Aravind Srinivasan