Sciweavers

895 search results - page 19 / 179
» Approximate convex decomposition
Sort
View
TALG
2010
110views more  TALG 2010»
14 years 8 months ago
Approximating fractional hypertree width
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
Dániel Marx
AMC
2007
89views more  AMC 2007»
14 years 9 months ago
A numerical iterative scheme for computing finite order rank-one convex envelopes
It is known that the i-th order laminated microstructures can be resolved by the k-th order rank-one convex envelopes with k ≥ i. So the requirement of establishing an efficient ...
Xin Wang, Zhiping Li
77
Voted
ICNP
2007
IEEE
15 years 4 months ago
FRASA: Feedback Retransmission Approximation for the Stability Region of Finite-User Slotted ALOHA
—FRASA, Feedback Retransmission Approximation for Slotted ALOHA, is proposed to study the stability region of finiteuser slotted ALOHA under collision channel. With FRASA, the s...
Ka-Hung Hui, On-Ching Yue, Wing Cheong Lau
ICPR
2004
IEEE
15 years 10 months ago
Missing Microarray Data Estimation Based on Projection onto Convex Sets Method
DNA microarrays have gained widespread uses in biological studies. Missing values in a microarray experiment must be estimated before further analysis. In this paper, we propose a...
Alan Wee-Chung Liew, Hong Yan, Xiangchao Gan
CVPR
2005
IEEE
15 years 11 months ago
Robust L1 Norm Factorization in the Presence of Outliers and Missing Data by Alternative Convex Programming
Matrix factorization has many applications in computer vision. Singular Value Decomposition (SVD) is the standard algorithm for factorization. When there are outliers and missing ...
Qifa Ke, Takeo Kanade