Sciweavers

5105 search results - page 175 / 1021
» Approximate Structural Consistency
Sort
View
ICRA
2009
IEEE
218views Robotics» more  ICRA 2009»
15 years 1 months ago
Automatically and efficiently inferring the hierarchical structure of visual maps
In Simultaneous Localisation and Mapping (SLAM), it is well known that probabilistic filtering approaches which aim to estimate the robot and map state sequentially suffer from poo...
Margarita Chli, Andrew J. Davison
151
Voted
GECCO
2009
Springer
204views Optimization» more  GECCO 2009»
15 years 8 months ago
Combined structure and motion extraction from visual data using evolutionary active learning
We present a novel stereo vision modeling framework that generates approximate, yet physically-plausible representations of objects rather than creating accurate models that are c...
Krishnanand N. Kaipa, Josh C. Bongard, Andrew N. M...
IMC
2007
ACM
15 years 5 months ago
Learning network structure from passive measurements
The ability to discover network organization, whether in the form of explicit topology reconstruction or as embeddings that approximate topological distance, is a valuable tool. T...
Brian Eriksson, Paul Barford, Robert Nowak, Mark C...
185
Voted
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
16 years 4 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau
ICDE
2010
IEEE
371views Database» more  ICDE 2010»
16 years 3 months ago
TASM: Top-k Approximate Subtree Matching
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...