3875 search results - page 564 / 775 » Approximation algorithms for the 0-extension problem |
193
click to vote
EGH
2009
Springer
15 years 4 months ago
2009
Springer
We present a strategy for performing view-adaptive, crack-free tessellation of Catmull-Clark subdivision surfaces entirely on programmable graphics hardware. Our scheme extends th...
179
click to vote
EMNLP
2009
15 years 4 months ago
2009
We report in this paper a way of doing Word Sense Disambiguation (WSD) that has its origin in multilingual MT and that is cognizant of the fact that parallel corpora, wordnets and...
168
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...
179
click to vote
AI
2011
Springer
15 years 1 months ago
2011
Springer
The paper focuses on developing effective importance sampling algorithms for mixed probabilistic and deterministic graphical models. The use of importance sampling in such graphi...
181
click to vote
IJACTAICIT
2010
15 years 1 months ago
2010
This paper describes an adaptive noise cancellation structure suitable for the separation and equalization of signals that coupled due to the approximate placing of primary and au...