401 search results - page 43 / 81 » Algorithms for a Simple Point Placement Problem |
195
click to vote
CCECE
2011
IEEE
13 years 11 months ago
2011
IEEE
— Although "Adaptive Mesh" is regarded as complicating method for object tracking accompanied with many controversies and obstacles, but it has been proposed that such ...
140
click to vote
EMNLP
2008
15 years 1 months ago
2008
This paper explores the challenge of scaling up language processing algorithms to increasingly large datasets. While cluster computing has been available in commercial environment...
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We derive a continuous probability distribution which generates neighbours of a point in an interval in a similar way to the bitwise mutation of a Gray code binary string...
STACS
2010
Springer
15 years 6 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
100
click to vote
CAD
2007
Springer
14 years 11 months ago
2007
Springer
In this paper, we present a BPM (Bézier Patch Mapping) algorithm which generates a strictly non-self-overlapping structured quadrilateral grid in a given four-sided planar region...