Sciweavers

324 search results - page 43 / 65
» Efficient Approximation Algorithms for Floorplan Area Minimi...
Sort
View
FSTTCS
1993
Springer
14 years 2 days ago
Compact Location Problems
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
Venkatesh Radhakrishnan, Sven Oliver Krumke, Madha...
EMNLP
2008
13 years 9 months ago
Complexity of Finding the BLEU-optimal Hypothesis in a Confusion Network
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
Gregor Leusch, Evgeny Matusov, Hermann Ney
ICIP
2010
IEEE
13 years 6 months ago
Poisson image reconstruction with total variation regularization
This paper describes an optimization framework for reconstructing nonnegative image intensities from linear projections contaminated with Poisson noise. Such Poisson inverse probl...
Rebecca Willett, Zachary T. Harmany, Roummel F. Ma...
FPL
2005
Springer
149views Hardware» more  FPL 2005»
14 years 1 months ago
Heterogeneity Exploration for Multiple 2D Filter Designs
Many image processing applications require fast convolution of an image with a set of large 2D filters. Field - Programmable Gate Arrays (FPGAs) are often used to achieve this go...
Christos-Savvas Bouganis, Peter Y. K. Cheung, Geor...
JACM
2007
121views more  JACM 2007»
13 years 7 months ago
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this paper we study single-commodity confluent flow pro...
Jiangzhuo Chen, Robert D. Kleinberg, Lászl&...