Sciweavers

1688 search results - page 136 / 338
» The Complexity of Rationalizing Matchings
Sort
View
ICIP
2000
IEEE
16 years 7 months ago
Fast Retrieval Methods for Images with Significant Variations
Fast image retrieval is the key to success for operations on large image databases, and a great many techniques have been developed for efficient retrieval. However, most of these...
Paul W. Fieguth, Riyin Wan
GBRPR
2009
Springer
15 years 9 months ago
Homeomorphic Alignment of Edge-Weighted Trees
Abstract. Motion capture, a currently active research area, needs estimation of the pose of the subject. This requires a match between a model and the 3D shape, constructed using a...
Benjamin Raynal, Michel Couprie, Venceslas Biri
TCBB
2010
114views more  TCBB 2010»
15 years 4 months ago
Cache-Oblivious Dynamic Programming for Bioinformatics
— We present efficient cache-oblivious algorithms for some well-studied string problems in bioinformatics including the longest common subsequence, global pairwise sequence alig...
Rezaul Alam Chowdhury, Hai-son Le, Vijaya Ramachan...
APIN
2006
136views more  APIN 2006»
15 years 6 months ago
Cell modeling with reusable agent-based formalisms
Biologists are building increasingly complex models and simulations of cells and other biological entities, and are looking at alternatives to traditional representations. Making ...
Ken Webb, Tony White
ASUNAM
2010
IEEE
15 years 7 months ago
COSI: Cloud Oriented Subgraph Identification in Massive Social Networks
Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...
Matthias Bröcheler, Andrea Pugliese, V. S. Su...