Sciweavers

439 search results - page 51 / 88
» Neighborhood Structures for GPU-Based Local Search Algorithm...
Sort
View
KDD
2003
ACM
175views Data Mining» more  KDD 2003»
14 years 9 months ago
Time and sample efficient discovery of Markov blankets and direct causal relations
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
Ioannis Tsamardinos, Constantin F. Aliferis, Alexa...
MMM
2011
Springer
251views Multimedia» more  MMM 2011»
13 years 14 days ago
Randomly Projected KD-Trees with Distance Metric Learning for Image Retrieval
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...
Pengcheng Wu, Steven C. H. Hoi, Duc Dung Nguyen, Y...
SIBGRAPI
2007
IEEE
14 years 3 months ago
Graph-based Object Tracking Using Structural Pattern Recognition
This paper proposes a model-based methodology for recognizing and tracking objects in digital image sequences. Objects are represented by attributed relational graphs (or ARGs), w...
Ana Beatriz V. Graciano, Roberto Marcondes Cesar J...
MVA
2002
13 years 8 months ago
A System for Locating License-plate Area from Images Taken under Complex Conditions
In this paper, an efficient edge-based approach, including implementation of a hardware system, for locating car license plate area from images taken under relatively complex cond...
Sunghoon Kim, Changsub Park, Gyeonghwan Kim
GECCO
2006
Springer
167views Optimization» more  GECCO 2006»
14 years 12 days ago
Estimating the destructiveness of crossover on binary tree representations
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
Luke Sheneman, James A. Foster