224 search results - page 14 / 45 » Homogeneous Decomposition of Polynomials |
86
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract—We are interested in topological analysis and processing of the large-scale distributed data generated by sensor networks. Naturally a large-scale sensor network is depl...
92
Voted
IACR
2011
14 years 3 days ago
2011
The Isomorphism of Polynomials (IP) is one of the most fundamental problems in multivariate public key cryptography (MPKC). In this paper, we introduce a new framework to study th...
103
click to vote
JACM
2007
15 years 10 days ago
2007
We consider the problem of finding a shortest cycle (freely) homotopic to a given simple cycle on a compact, orientable surface. For this purpose, we use a pants decomposition of...
WG
2005
Springer
15 years 6 months ago
2005
Springer
In this paper, we consider the recognition problem on the HHDS-free graphs, a class of homogeneously orderable graphs, and we show that it has polynomial time complexity. In partic...
151
Voted
ICIP
1998
IEEE
16 years 1 months ago
1998
IEEE
This paper outlines a geometric parameterization of 2D curves where the parameterization is in terms of geometric invariants and terms that determine an intrinsic coordinate system...