Sciweavers

2354 search results - page 103 / 471
» Assignment Problems
Sort
View
JCO
2008
117views more  JCO 2008»
13 years 10 months ago
Approximation algorithms for connected facility location problems
We study Connected Facility Location problems. We are given a connected graph G = (V, E) with nonnegative edge cost ce for each edge e E, a set of clients D V such that each cli...
Mohammad Khairul Hasan, Hyunwoo Jung, Kyung-Yong C...
ICIP
2010
IEEE
13 years 8 months 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
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
13 years 11 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
EURODAC
1995
IEEE
133views VHDL» more  EURODAC 1995»
14 years 1 months ago
Tree restructuring approach to mapping problem in cellular-architecture FPGAs
A new technique for mapping combinational circuits to Fine-Grain Cellular-Architecture FPGAs is presented. The proposed tree restructuring algorithm preserves local connectivity a...
Naveen Ramineni, Malgorzata Chrzanowska-Jeske, Nav...
ETS
2000
IEEE
154views Hardware» more  ETS 2000»
13 years 10 months ago
Task Structuring for On-line Problem Based Learning: A Case Study
Getting students to collaborate on group projects in a face-to-face scenario can be difficult enough -- but how does one approach collaborative projects in a Web-based environment...
Vanessa Paz Dennen