Sciweavers

2827 search results - page 362 / 566
» Robustness of PSPACE-complete sets
Sort
View
139
Voted
ESA
2003
Springer
111views Algorithms» more  ESA 2003»
15 years 9 months ago
Fast Smallest-Enclosing-Ball Computation in High Dimensions
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
Kaspar Fischer, Bernd Gärtner, Martin Kutz
148
Voted
IPMI
2003
Springer
15 years 9 months ago
Neighbor-Constrained Segmentation with 3D Deformable Models
A novel method for the segmentation of multiple objects from 3D medical images using inter-object constraints is presented. Our method is motivated by the observation that neighbor...
Jing Yang, Lawrence H. Staib, James S. Duncan
SPAA
2010
ACM
15 years 9 months ago
Collaborative scoring with dishonest participants
Consider a set of players that are interested in collectively evaluating a set of objects. We develop a collaborative scoring protocol in which each player evaluates a subset of t...
Seth Gilbert, Rachid Guerraoui, Faezeh Malakouti R...
TOOLS
2000
IEEE
15 years 8 months ago
Testing-for-Trust: The Genetic Selection Model Applied to Component Qualification
This paper presents a method and a tool for building trustable OO components. The methodology is based on an integrated design and test approach for OO software components. It is ...
Benoit Baudry, Vu Le Hanh, Yves Le Traon
CIKM
2000
Springer
15 years 8 months ago
Analyzing the Effectiveness and Applicability of Co-training
Recently there has been significant interest in supervised learning algorithms that combine labeled and unlabeled data for text learning tasks. The co-training setting [1] applie...
Kamal Nigam, Rayid Ghani