526 search results - page 56 / 106 » Improved Decomposition of STGs |
ICPADS
2000
IEEE
14 years 2 months ago
2000
IEEE
The most costly spatial operation in spatial databases is a spatial join with combines objects from two data sets based on spatial predicates. Even if the execution time of sequen...
COCO
2010
Springer
14 years 1 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
FGR
2004
IEEE
14 years 1 months ago
2004
IEEE
1 Active Appearance Models (AAM) is very powerful for extracting objects, e.g. faces, from images. It is composed of two parts: the AAM subspace model and the AAM search. While th...
FOCS
2004
IEEE
14 years 1 months ago
2004
IEEE
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...
GECCO
2006
Springer
14 years 1 months ago
2006
Springer
First, the covariance matrix adaptation (CMA) with rankone update is introduced into the (1+1)-evolution strategy. An improved implementation of the 1/5-th success rule is propose...