Sciweavers

179 search results - page 17 / 36
» Polynomial Time Approximation Schemes for Geometric k-Cluste...
Sort
View
COMPGEOM
2010
ACM
14 years 28 days ago
Approximating loops in a shortest homology basis from point data
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...
Tamal K. Dey, Jian Sun, Yusu Wang
RTAS
2006
IEEE
14 years 1 months ago
Task Partitioning with Replication upon Heterogeneous Multiprocessor Systems
The heterogeneous multiprocessor task partitioning with replication problem involves determining a mapping of recurring tasks upon a set consisting of different processing units i...
Sathish Gopalakrishnan, Marco Caccamo
COMPSAC
2004
IEEE
13 years 11 months ago
On the Complexity of Finding Emerging Patterns
Emerging patterns have been studied as a useful type of pattern for the diagnosis and understanding of diseases based on the analysis of gene expression profiles. They are useful ...
Lusheng Wang, Hao Zhao, Guozhu Dong, Jianping Li
COMPGEOM
2009
ACM
14 years 2 months ago
Integral estimation from point cloud in d-dimensional space: a geometric view
Integration over a domain, such as a Euclidean space or a Riemannian manifold, is a fundamental problem across scientific fields. Many times, the underlying domain is only acces...
Chuanjiang Luo, Jian Sun, Yusu Wang
RTSS
2002
IEEE
14 years 23 days ago
Approximate Schedulability Analysis
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
Samarjit Chakraborty, Simon Künzli, Lothar Th...