1092 search results - page 115 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
192
click to vote
KDD
2005
ACM
16 years 6 months ago
2005
ACM
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...
182
Voted
ICML
2004
IEEE
15 years 11 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 ...
168
click to vote
ECCV
2004
Springer
16 years 8 months ago
2004
Springer
We present an analytic solution to the problem of estimating multiple 2-D and 3-D motion models from two-view correspondences or optical flow. The key to our approach is to view th...
160
click to vote
COMPGEOM
2009
ACM
16 years 19 days ago
2009
ACM
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of...
176
click to vote
COMPGEOM
1997
ACM
15 years 10 months ago
1997
ACM
Abstract: We propose an e cient method that determines the sign of a multivariate polynomial expression with integer coe cients. This is a central operation on which the robustness...