Sciweavers

13336 search results - page 2220 / 2668
» Computer Vision: Algorithms and Applications
Sort
View
CORR
2010
Springer
88views Education» more  CORR 2010»
15 years 7 months ago
Grothendieck inequalities for semidefinite programs with rank constraint
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of mathematics and computer science. They can be interpreted as upper bounds for the ...
Jop Briët, Fernando Mário de Oliveira ...
HEURISTICS
2008
153views more  HEURISTICS 2008»
15 years 7 months ago
Bringing order into the neighborhoods: relaxation guided variable neighborhood search
In this article we investigate a new variant of Variable Neighborhood Search (VNS): Relaxation Guided Variable Neighborhood Search. It is based on the general VNS scheme and a new...
Jakob Puchinger, Günther R. Raidl
CAGD
2006
97views more  CAGD 2006»
15 years 7 months ago
Conditions for use of a non-selfintersection conjecture
Abstract. Volino and Thalmann have published a conjecture proposing sufficient conditions for non-selfintersection of surfaces. Such conditions may be used in solid modeling, compu...
Lars-Erik Andersson, Neil F. Stewart, Malika Zidan...
DAM
2006
88views more  DAM 2006»
15 years 7 months ago
NP-completeness results for edge modification problems
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs...
Pablo Burzyn, Flavia Bonomo, Guillermo Durá...
IJAR
2006
118views more  IJAR 2006»
15 years 7 months ago
Learning Bayesian network parameters under order constraints
We consider the problem of learning the parameters of a Bayesian network from data, while taking into account prior knowledge about the signs of influences between variables. Such...
A. J. Feelders, Linda C. van der Gaag
« Prev « First page 2220 / 2668 Last » Next »