Sciweavers

64 search results - page 7 / 13
» Geometric Searching over the Rationals
Sort
View
COMPGEOM
1995
ACM
14 years 1 months ago
Searching for the Kernel of a Polygon - A Competitive Strategy
We present a competitive strategy for walking into the kernel of an initially unknown star-shaped polygon. From an arbitrary start point, s, within the polygon, our strategy find...
Christian Icking, Rolf Klein
CVPR
2009
IEEE
1517views Computer Vision» more  CVPR 2009»
15 years 5 months ago
Linear Solution to Scale and Rotation Invariant Object Matching
Images of an object undergoing ego- or camera- motion often appear to be scaled, rotated, and deformed versions of each other. To detect and match such distorted patterns to a s...
Hao Jiang, Stella X. Yu
DEXA
2006
Springer
126views Database» more  DEXA 2006»
13 years 11 months ago
Hypersphere Indexer
Indexing high-dimensional data for efficient nearest-neighbor searches poses interesting research challenges. It is well known that when data dimension is high, the search time can...
Navneet Panda, Edward Y. Chang, Arun Qamra
CSCLP
2004
Springer
14 years 3 months ago
Characterization of a New Restart Strategy for Randomized Backtrack Search
We propose an improved restart strategy for randomized backtrack search, and evaluate its performance by comparing to other heuristic and stochastic search techniques for solving r...
Venkata Praveen Guddeti, Berthe Y. Choueiry
ESWA
2007
100views more  ESWA 2007»
13 years 9 months ago
Using memetic algorithms with guided local search to solve assembly sequence planning
The goal of assembly planning consists in generating feasible sequences to assemble a product and selecting an efficient assembly sequence from which related constraint factors su...
Hwai-En Tseng, Wen-Pai Wang, Hsun-Yi Shih