Sciweavers

6315 search results - page 88 / 1263
» Approximating Solution Structure
Sort
View
APPROX
2007
Springer
99views Algorithms» more  APPROX 2007»
15 years 9 months ago
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...
Ilias Diakonikolas, Mihalis Yannakakis
CONIELECOMP
2005
IEEE
15 years 8 months ago
Approximate Searching on Compressed Text
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
Carlos Avendaño Pérez, Claudia Fereg...
ASPDAC
2007
ACM
121views Hardware» more  ASPDAC 2007»
15 years 6 months ago
Approximation Algorithm for Process Mapping on Network Processor Architectures
The high performance requirements of networking applications has led to the advent of programmable network processor (NP) architectures that incorporate symmetric multiprocessing, ...
Christopher Ostler, Karam S. Chatha, Goran Konjevo...
ESA
2006
Springer
103views Algorithms» more  ESA 2006»
15 years 6 months ago
Greedy in Approximation Algorithms
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...
Julián Mestre
NPL
2008
63views more  NPL 2008»
15 years 2 months ago
New Routes from Minimal Approximation Error to Principal Components
We introduce two new methods of deriving the classical PCA in the framework of minimizing the mean square error upon performing a lower-dimensional approximation of the data. These...
Abhilash Alexander Miranda, Yann-Aël Le Borgn...