Sciweavers

4432 search results - page 491 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
114
Voted
WEA
2005
Springer
93views Algorithms» more  WEA 2005»
15 years 9 months ago
From Static Code Distribution to More Shrinkage for the Multiterminal Cut
We present the problem of statically distributing instructions of a common programming language, a problem which we prove equivalent to the multiterminal cut problem. We design e...
Bram De Wachter, Alexandre Genon, Thierry Massart
CVPR
1997
IEEE
15 years 8 months ago
Normalized Cuts and Image Segmentation
ÐWe propose a novel approach for solving the perceptual grouping problem in vision. Rather than focusing on local features and their consistencies in the image data, our approach ...
Jianbo Shi, Jitendra Malik
159
Voted
NIPS
2007
15 years 5 months ago
Adaptive Embedded Subgraph Algorithms using Walk-Sum Analysis
We consider the estimation problem in Gaussian graphical models with arbitrary structure. We analyze the Embedded Trees algorithm, which solves a sequence of problems on tractable...
Venkat Chandrasekaran, Jason K. Johnson, Alan S. W...
143
Voted
COR
2008
95views more  COR 2008»
15 years 4 months ago
Good triangulations yield good tours
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...
Adam N. Letchford, Nicholas A. Pearson
124
Voted
ICIP
2009
IEEE
15 years 1 months ago
Gamut fitting for image composition applications
Existing digital image composition algorithms neglect the out-of-gamut problem, i.e. some pixel values in a composited image exceed the displayable or printable range. In this pap...
Wenxian Yang, Jianmin Zheng, Jianfei Cai