1144 search results - page 126 / 229 » Fractal Algorithm for Finding Global Optimal Solution |
104
click to vote
PAKDD
2000
ACM
15 years 1 months ago
2000
ACM
In clustering, global feature selection algorithms attempt to select a common feature subset that is relevant to all clusters. Consequently, they are not able to identify individu...
CORR
2006
Springer
14 years 10 months ago
2006
Springer
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
108
click to vote
TJS
2002
14 years 9 months ago
2002
Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This...
ICRA
2008
IEEE
15 years 4 months ago
2008
IEEE
— We present a new algorithm for solving the global localization problem called Frozen-Time Smoother (FTS). Time is ‘frozen’, in the sense that the belief always refers to th...
CAD
2007
Springer
14 years 10 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...