817 search results - page 43 / 164 » An Optimal Linear Time Algorithm for Quasi-Monotonic Segment... |
155
click to vote
ISPD
2005
ACM
15 years 9 months ago
2005
ACM
The sustained progress of VLSI technology has altered the landscape of routing which is a major physical design stage. For timing driven routings, traditional approaches which con...
134
Voted
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
Many interactive image segmentation approaches use an objective function which includes appearance models as an unknown variable. Since the resulting optimization problem is NP-har...
117
Voted
CVPR
2009
IEEE
16 years 10 months ago
2009
IEEE
Normalized Cut is a widely used technique for solving a
variety of problems. Although finding the optimal normalized
cut has proven to be NP-hard, spectral relaxations can
be ap...
120
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
184
Voted
Publication
For quantitative analysis of histopathological images,
such as the lymphoma grading systems, quantification of
features is usually carried out on single cells before categorizing...