Sciweavers

4488 search results - page 91 / 898
» Properties of NP-Complete Sets
Sort
View
JSW
2008
89views more  JSW 2008»
13 years 8 months ago
Secure Set Union and Bag Union Computation for Guaranteeing Anonymity of Distrustful Participants
Abstract-- The computation of the union operator for different distributed datasets involves two challenges when participants are curious and can even act malicious: guaranteeing a...
Stefan Böttcher, Sebastian Obermeier
JOTA
2010
104views more  JOTA 2010»
13 years 2 months ago
Structure and Weak Sharp Minimum of the Pareto Solution Set for Piecewise Linear Multiobjective Optimization
Abstract. In this paper the Pareto solution set of a piecewise linear multiobjective optimization problem in a normed space is shown to be a union of finitely many semiclosed polyh...
X. Q. Yang, N. D. Yen
MICCAI
2009
Springer
14 years 9 months ago
A Fully Automatic Random Walker Segmentation for Skin Lesions in a Supervised Setting
Abstract. We present a method for automatically segmenting skin lesions by initializing the random walker algorithm with seed points whose properties, such as colour and texture, h...
Paul Wighton, Maryam Sadeghi, Tim K. Lee, M. St...
WADS
2009
Springer
236views Algorithms» more  WADS 2009»
14 years 2 months ago
Inspecting a Set of Strips Optimally
We consider a set of axis-parallel nonintersecting strips in the plane. An observer starts to the left of all strips and ends to the right, thus visiting all strips in the given or...
Tom Kamphans, Elmar Langetepe
DATE
2007
IEEE
101views Hardware» more  DATE 2007»
14 years 2 months ago
Polynomial-time subgraph enumeration for automated instruction set extension
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time ...
Paolo Bonzini, Laura Pozzi