2766 search results - page 211 / 554 » Algorithms for trigonometric polynomials |
128
click to vote
ICWS
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...
149
click to vote
COMGEO
2010
ACM
15 years 4 months ago
2010
ACM
: We present a method to compute the exact topology of a real algebraic surface S, implicitly given by a polynomial f Q[x,y,z] of arbitrary total degree N. Additionally, our analy...
131
Voted
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
This paper is focused on the Co-segmentation problem
[1] – where the objective is to segment a similar object from
a pair of images. The background in the two images may be
ar...
117
Voted
INFOCOM
2008
IEEE
15 years 11 months ago
2008
IEEE
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
130
click to vote
ADHOCNOW
2008
Springer
15 years 11 months ago
2008
Springer
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...