Sciweavers

3317 search results - page 206 / 664
» Strategies in Rigid-Variable Methods
Sort
View
IJCV
2008
157views more  IJCV 2008»
15 years 6 months ago
Pairwise Matching of 3D Fragments Using Cluster Trees
Abstract We propose a novel and efficient surface matching approach for reassembling broken solids as well as for matching assembly components using cluster trees of oriented point...
Simon Winkelbach, Friedrich M. Wahl
TCOM
2010
112views more  TCOM 2010»
15 years 5 months ago
On further reduction of complexity in tree pruning based sphere search
Abstract—In this letter, we propose an extension of the probabilistic tree pruning sphere decoding (PTP-SD) algorithm that provides further improvement of the computational compl...
Byonghyo Shim, Insung Kang
TIP
2010
112views more  TIP 2010»
15 years 4 months ago
Variable Density Compressed Image Sampling
Compressed sensing (CS) provides an efficient way to acquire and reconstruct natural images from a reduced number of linear projection measurements at sub-Nyquist sampling rates....
Zhongmin Wang, Gonzalo R. Arce
FORTE
2009
15 years 4 months ago
A Model-Checking Approach for Service Component Architectures
We present a strategy for model-checking the correctness of service composition. We do so in the context of SRML, a formal modelling framework for service-oriented computing being ...
João Abreu, Franco Mazzanti, José Lu...
CORR
2011
Springer
145views Education» more  CORR 2011»
15 years 1 months ago
Global Search Based on Efficient Diagonal Partitions and a set of Lipschitz Constants
In the paper, the global optimization problem of a multidimensional “black-box” function satisfying the Lipschitz condition over a hyperinterval with an unknown Lipschitz const...
Yaroslav D. Sergeyev, Dmitri E. Kvasov