Sciweavers

1816 search results - page 60 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
ICASSP
2011
IEEE
14 years 9 months ago
Stochastic optimization based on the Laplace transform order with applications to precoder designs
Stochastic optimization arising from precoding in a multi-antenna fading channel with channel mean feedback to maximize data rates is important but challenging. The use of relayin...
Minhua Ding, Keith Q. T. Zhang
MFCS
2009
Springer
16 years 13 days ago
The Longest Path Problem Is Polynomial on Interval Graphs
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
Kyriaki Ioannidou, George B. Mertzios, Stavros D. ...
CISS
2008
IEEE
16 years 10 days ago
Optimization via communication networks
— It has been known since the early 1990s that backpressure-type algorithms for communication networks (such as the Max-Weight algorithm) can be used to approximately solve stati...
Matthew Andrews
CVPR
2000
IEEE
16 years 8 months ago
Structure from Motion without Correspondence
A method is presented to recover 3D scene structure and camera motion from multiple images without the need for correspondence information. The problem is framed as finding the ma...
Frank Dellaert, Steven M. Seitz, Charles E. Thorpe...
ICCAD
2006
IEEE
117views Hardware» more  ICCAD 2006»
16 years 2 months ago
Post-routing redundant via insertion and line end extension with via density consideration
- Redundant via insertion and line end extension employed in the post-routing stage are two well known and highly recommended techniques to reduce yield loss due to via failure. Ho...
Kuang-Yao Lee, Ting-Chi Wang, Kai-Yuan Chao