126 search results - page 19 / 26 » Finding minimal bases in arbitrary spline spaces |
COMGEO
2008
ACM
14 years 9 months ago
2008
ACM
We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which ...
SIAMCOMP
2008
14 years 9 months ago
2008
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
ICIAR
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we present a new image segmentation method based on energy minimization for iteratively evolving an implicit active contour. Methods for active contour evolution is ...
108
click to vote
HPCA
1998
IEEE
15 years 1 months ago
1998
IEEE
Good network hardware performance is often squandered by overheads for accessing the network interface (NI) within a host. NIs that support user-level messaging avoid frequent ope...
CVPR
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper, we develop a general classification framework called Kullback-Leibler Boosting, or KLBoosting. KLBoosting has following properties. First, classification is based o...