Sciweavers

417 search results - page 32 / 84
» Convex Shape Decomposition
Sort
View
ASPDAC
2004
ACM
132views Hardware» more  ASPDAC 2004»
13 years 11 months ago
On handling arbitrary rectilinear shape constraint
Non-rectangular (rectilinear) shape occurs very often in deep submicron floorplanning. Most previous algorithms are designed to handle only convex rectilinear blocks. However, han...
Xiaoping Tang, Martin D. F. Wong
CORR
2010
Springer
189views Education» more  CORR 2010»
13 years 6 months ago
Robust PCA via Outlier Pursuit
Singular Value Decomposition (and Principal Component Analysis) is one of the most widely used techniques for dimensionality reduction: successful and efficiently computable, it ...
Huan Xu, Constantine Caramanis, Sujay Sanghavi
IANDC
2006
86views more  IANDC 2006»
13 years 7 months ago
Table design in dynamic programming
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
Peter Steffen, Robert Giegerich
CVIU
2006
105views more  CVIU 2006»
13 years 7 months ago
The representation and matching of categorical shape
We present a framework for categorical shape recognition. The coarse shape of an object is captured by a multiscale blob decomposition, representing the compact and elongated part...
Ali Shokoufandeh, Lars Bretzner, Diego Macrini, M....
CGF
2008
144views more  CGF 2008»
13 years 7 months ago
Deformation-Driven Shape Correspondence
Non-rigid 3D shape correspondence is a fundamental and difficult problem. Most applications which require a correspondence rely on manually selected markers. Without user assistan...
Hao Zhang 0002, Alla Sheffer, Daniel Cohen-Or, Qua...