Sciweavers

16596 search results - page 199 / 3320
» Generalized Assignment Problems
Sort
View
126
Voted
JCO
1998
97views more  JCO 1998»
15 years 2 months ago
The Travelling Salesman Problem on Permuted Monge Matrices
We consider traveling salesman problems (TSPs) with a permuted Monge matrix as cost matrix where the associated patching graph has a specially simple structure: a multistar, a mult...
Rainer E. Burkard, Vladimir G. Deineko, Gerhard J....
147
Voted
ICIP
2010
IEEE
15 years 15 days ago
Constructing a sparse convolution matrix for shift varying image restoration problems
Convolution operator is a linear operator characterized by a point spread functions (PSF). In classical image restoration problems, the blur is usually shift invariant and so the ...
Stanley H. Chan
144
Voted
BERTINORO
2005
Springer
15 years 8 months ago
Power-Aware Distributed Protocol for a Connectivity Problem in Wireless Sensor Networks
We consider the problem of assigning transmission powers to the nodes of a wireless network in such a way that all the nodes are connected by bidirectional links and the total powe...
Roberto Montemanni, Luca Maria Gambardella
INFOSCALE
2007
ACM
15 years 4 months ago
A flexible mandatory access control policy for XML databases
A flexible mandatory access control policy (MAC) for XML databases is presented in this paper. The label type and label access policy can be defined according to the requirements ...
Hong Zhu, Renchao Jin, Kevin Lü
SDM
2003
SIAM
125views Data Mining» more  SDM 2003»
15 years 3 months ago
Scalable, Balanced Model-based Clustering
This paper presents a general framework for adapting any generative (model-based) clustering algorithm to provide balanced solutions, i.e., clusters of comparable sizes. Partition...
Shi Zhong, Joydeep Ghosh