2766 search results - page 421 / 554 » Algorithms for trigonometric polynomials |
137
Voted
GD
2005
Springer
15 years 9 months ago
2005
Springer
A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planari...
118
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
122
click to vote
WABI
2005
Springer
15 years 9 months ago
2005
Springer
d Abstract] Tamir Tuller , Efrat Oron , Erez Makavy , Daniel A. Chamovitz † , and Benny Chor ‡ Tel-Aviv University, Tel-Aviv 69978, Israel. Abstract. We study gene expression d...
154
click to vote
ICML
2004
IEEE
15 years 9 months ago
2004
IEEE
We investigate how to learn a kernel matrix for high dimensional data that lies on or near a low dimensional manifold. Noting that the kernel matrix implicitly maps the data into ...
123
click to vote
ESA
2004
Springer
15 years 9 months ago
2004
Springer
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...