3630 search results - page 298 / 726 » How to Compare Treebanks |
198
click to vote
CGF
2010
15 years 7 months ago
2010
We introduce in this paper a new method for smooth foldover-free warping of images. It allows users to specify the constraints in two different ways: positional constraints to con...
200
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Finding the product of two polynomials is an essential and basic problem in computer algebra. While most previous results have focused on the worst-case complexity, we instead emp...
195
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Debugging is an important prerequisite for the wide-spread application of ontologies, especially in areas that rely upon everyday users to create and maintain knowledge b...
200
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorith...
126
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
In this paper, we propose in Dezert-Smarandache Theory (DSmT) framework, a new probabilistic transformation, called DSmP, in order to build a subjective probability measure from an...