288 search results - page 36 / 58 » Notes on computing minimal approximant bases |
NAACL
2010
13 years 7 months ago
2010
Previous work on dependency parsing used various kinds of combination models but a systematic analysis and comparison of these approaches is lacking. In this paper we implemented ...
EMMCVPR
2011
Springer
12 years 9 months ago
2011
Springer
Length and area regularization are commonplace for inverse problems today. It has however turned out to be much more difficult to incorporate a curvature prior. In this paper we pr...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
DATE
2008
IEEE
14 years 4 months ago
2008
IEEE
— As the feature size of transistors gets smaller, fabricating them becomes challenging. Manufacturing process follows various corrective design-for-manufacturing (DFM) steps to ...
ICCV
2007
IEEE
14 years 11 months ago
2007
IEEE
We present a viewpoint-based approach for the quick fusion of multiple stereo depth maps. Our method selects depth estimates for each pixel that minimize violations of visibility ...