Sciweavers

3875 search results - page 118 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
SIAMMAX
2011
141views more  SIAMMAX 2011»
14 years 7 months ago
Best Low Multilinear Rank Approximation of Higher-Order Tensors, Based on the Riemannian Trust-Region Scheme
Higher-order tensors are used in many application fields, such as statistics, signal processing, and scientific computing. Efficient and reliable algorithms for manipulating thes...
Mariya Ishteva, Pierre-Antoine Absil, Sabine Van H...
AMC
2006
115views more  AMC 2006»
15 years 4 months ago
A memetic algorithm for a vehicle routing problem with backhauls
This paper considers an extension of a vehicle routing problem with backhauls (VRPB). In this problem, a set of costumers are divided in two subsets consisting of linehaul and bac...
Reza Tavakkoli-Moghaddam, A. R. Saremi, M. S. Ziae...
NIPS
2004
15 years 5 months ago
Triangle Fixing Algorithms for the Metric Nearness Problem
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
Inderjit S. Dhillon, Suvrit Sra, Joel A. Tropp
EURODAC
1994
IEEE
186views VHDL» more  EURODAC 1994»
15 years 8 months ago
Algorithms for a switch module routing problem
We consider a switch module routing problem for symmetric array FPGAs. The work is motivated by two applications. The rst is that of eciently evaluating switch module designs [8]...
Shashidhar Thakur, D. F. Wong, S. Muthukrishnan
SODA
2001
ACM
163views Algorithms» more  SODA 2001»
15 years 5 months ago
Algorithms for facility location problems with outliers
d Abstract) Moses Charikar Samir Khullery David M. Mountz Giri Narasimhanx Facility location problems are traditionally investigated with the assumption that all the clients are t...
Moses Charikar, Samir Khuller, David M. Mount, Gir...