Sciweavers

3575 search results - page 605 / 715
» Structured motifs search
Sort
View
CCCG
1993
15 years 7 months ago
Widest-corridor Problems
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
Ravi Janardan, Franco P. Preparata
WCE
2007
15 years 7 months ago
A Patch-by-Patch Shape Matching Procedure for Rigid Body Docking
Abstract—Docking simulates molecular interactions. Protein - protein docking, owing to the sizes of molecules, is a very challenging problem. As the number of degrees of freedom ...
Vipin K. Tripathi
ACCV
2009
Springer
15 years 7 months ago
Adaptive-Scale Robust Estimator Using Distribution Model Fitting
We propose a new robust estimator for parameter estimation in highly noisy data with multiple structures and without prior information on the noise scale of inliers. This is a diag...
Trung Ngo Thanh, Hajime Nagahara, Ryusuke Sagawa, ...
AIPS
2009
15 years 7 months ago
Computing Robust Plans in Continuous Domains
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...
Christian Fritz, Sheila A. McIlraith
ALENEX
2009
191views Algorithms» more  ALENEX 2009»
15 years 7 months ago
Theory and Practise of Monotone Minimal Perfect Hashing
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Seba...