Sciweavers

2743 search results - page 140 / 549
» Minimization of an M-convex Function
Sort
View
CEC
2008
IEEE
15 years 7 months ago
A technique for the visualization of population-based algorithms
— A technique for the visualization of stochastic population–based algorithms in multidimensional problems with known global minimizers is proposed. The technique employs proje...
Konstantinos E. Parsopoulos, Voula C. Georgopoulos...
WINE
2007
Springer
97views Economy» more  WINE 2007»
16 years 17 days ago
K-NCC: Stability Against Group Deviations in Non-cooperative Computation
A function is non-cooperative computable [NCC] if honest agents can compute it by reporting truthfully their private inputs, while unilateral deviations by the players are not bene...
Itai Ashlagi, Andrey Klinger, Moshe Tennenholtz
ICDE
2007
IEEE
115views Database» more  ICDE 2007»
16 years 7 months ago
Preservation Of Patterns and Input-Output Privacy
Abstract breaches. To do so, the data custodian needs to transform its data. To determine the appropriate transforPrivacy preserving data mining so far has mainly mation, there are...
Shaofeng Bu, Laks V. S. Lakshmanan, Raymond T. Ng,...
PATMOS
2007
Springer
16 years 17 days ago
Optimization for Real-Time Systems with Non-convex Power Versus Speed Models
Abstract. Until now, the great majority of research in low-power systems has assumed a convex power model. However, recently, due to the confluence of emerging technological and ar...
Ani Nahapetian, Foad Dabiri, Miodrag Potkonjak, Ma...
ECCV
2010
Springer
15 years 11 months ago
3D Point Correspondence by Minimum Description Length in Feature Space
Abstract. Finding point correspondences plays an important role in automatically building statistical shape models from a training set of 3D surfaces. For the point correspondence ...