Sciweavers

104 search results - page 4 / 21
» Rigid substructure search
Sort
View
WABI
2004
Springer
15 years 4 months ago
Local Search Heuristic for Rigid Protein Docking
Abstract. We give an algorithm that locally improves the fit between two proteins modeled as space-filling diagrams. The algorithm defines the fit in purely geometric terms and...
Vicky Choi, Pankaj K. Agarwal, Herbert Edelsbrunne...
ICCV
2007
IEEE
15 years 5 months ago
Non-Rigid Object Alignment with a Mismatch Template Based on Exhaustive Local Search
Non-rigid object alignment is especially challenging when only a single appearance template is available and target and template images fail to match. Two sources of discrepancy b...
Yang Wang, Simon Lucey, Jeffrey F. Cohn
CHI
2009
ACM
15 years 11 months ago
On being supple: in search of rigor without rigidity in meeting new design and evaluation challenges for HCI practitioners
In this paper, we argue that HCI practitioners are facing new challenges in design and evaluation that can benefit from the establishment of commonly valued use qualities, with as...
Katherine Isbister, Kristina Höök
ESWS
2008
Springer
15 years 13 days ago
Graph Summaries for Subgraph Frequency Estimation
A fundamental problem related to graph structured databases is searching for substructures. One issue with respect to optimizing such searches is the ability to estimate the freque...
Angela Maduko, Kemafor Anyanwu, Amit P. Sheth, Pau...
ICML
2007
IEEE
15 years 11 months ago
Entire regularization paths for graph data
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
Koji Tsuda