Sciweavers

2127 search results - page 10 / 426
» Computing large matchings fast
Sort
View
CVPR
2007
IEEE
14 years 9 months ago
Efficient Indexing For Articulation Invariant Shape Matching And Retrieval
Most shape matching methods are either fast but too simplistic to give the desired performance or promising as far as performance is concerned but computationally demanding. In th...
Soma Biswas, Gaurav Aggarwal, Rama Chellappa
DILS
2010
Springer
13 years 8 months ago
On Matching Large Life Science Ontologies in Parallel
Matching life science ontologies to determine ontology mappings has recently become an active field of research. The large size of existing ontologies and the application of comple...
Anika Gross, Michael Hartung, Toralf Kirsten, Erha...
ISMB
1994
13 years 8 months ago
High Speed Pattern Matching in Genetic Data Base with Reconfigurable Hardware
Homologydetection in large data bases is probably the most time consuming operation in molecular genetic computing systems. Moreover, the progresses made all around the world conc...
Eric Lemoine, Joël Quinqueton, Jean Sallantin
CVIU
2011
12 years 11 months ago
Graph-based quadratic optimization: A fast evolutionary approach
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
Samuel Rota Bulò, Marcello Pelillo, Immanue...
TCSV
2010
13 years 2 months ago
Action Detection in Cluttered Video With Successive Convex Matching
We propose a novel successive convex matching method for human action detection in cluttered video. Human actions are represented as sequences of poses, and specific actions are de...
Hao Jiang, Mark S. Drew, Ze-Nian Li