Sciweavers

2652 search results - page 278 / 531
» Privacy-preserving linear programming
Sort
View
100
Voted
IPL
2008
95views more  IPL 2008»
15 years 3 months ago
Distortion lower bounds for line embeddings
In this paper, we show how we can derive lower bounds and also compute the exact distortion for the line embeddings of some special metrics, especially trees and graphs with certai...
Claire Mathieu, Charalampos Papamanthou
NECO
2008
83views more  NECO 2008»
15 years 3 months ago
Sequential Fixed-Point ICA Based on Mutual Information Minimization
A new gradient technique is introduced for linear ICA based on the Edgeworth expansion of mutual information, for which the algorithm operates sequentially using fixed-point itera...
Marc M. Van Hulle
MP
2006
116views more  MP 2006»
15 years 3 months ago
Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing Problem
We consider the vehicle routing problem where one can choose among vehicles with different costs and capacities to serve the trips. We develop six different formulations: the first...
Hande Yaman
101
Voted
NETWORKS
2006
15 years 3 months ago
A bidirected generalization of network matrices
We define binet matrices, which furnish a direct generalization of totally unimodular network matrices and arise from the node-edge incidence matrices of bidirected graphs in the ...
Gautam Appa, Balázs Kotnyek
112
Voted
IPL
2007
107views more  IPL 2007»
15 years 3 months ago
Flows in dynamic networks with aggregate arc capacities
Dynamic networks are characterized by transit times on edges. Dynamic flow problems consider transshipment problems in dynamic networks. We introduce a new version of dynamic fl...
Vardges Melkonian