5210 search results - page 415 / 1042 » Exact geometric computation |
164
Voted
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
Given a set S of segments in the plane, a polygon P is an intersecting polygon of S if every segment in S intersects the interior or the boundary of P. The problem MPIP of computi...
207
Voted
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract –In this paper, a variational message passing framework is proposed for Markov random fields, which is computationally more efficient and admits wider applicability comp...
180
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
We provide in this article two characterisation results, describing exactly which terms verify the dinaturality diagram, in Church-style system F and in Curry-style system F. The ...
156
click to vote
ICIP
2008
IEEE
16 years 1 months ago
2008
IEEE
We propose new discrete-to-continuous interpolation models for hexagonally sampled data, that generalize two families of splines developed in the literature for the hexagonal latt...
159
Voted
INFOCOM
2005
IEEE
16 years 14 days ago
2005
IEEE
— We study the problem of determining the minimum number of limited range wavelength converters needed to construct strictly, wide-sense, and rearrangeably nonblocking optical cr...