Sciweavers

3172 search results - page 124 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
SCN
2008
Springer
128views Communications» more  SCN 2008»
15 years 6 months ago
On Linear Secret Sharing for Connectivity in Directed Graphs
In this work we study linear secret sharing schemes for s-t connectivity in directed graphs. In such schemes the parties are edges of a complete directed graph, and a set of partie...
Amos Beimel, Anat Paskin
MICCAI
2002
Springer
16 years 7 months ago
A Statistical Shape Model for the Liver
The use of statistical shape models is a promising approach for robust segmentation of medical images. One of the major challenges in building a 3D shape model from a training set ...
Hans Lamecker, Thomas Lange, Martin Seebass
ICML
2005
IEEE
16 years 7 months ago
Learning approximate preconditions for methods in hierarchical plans
A significant challenge in developing planning systems for practical applications is the difficulty of acquiring the domain knowledge needed by such systems. One method for acquir...
Dana S. Nau, David W. Aha, Héctor Muñ...
ICASSP
2009
IEEE
16 years 1 months ago
Reconstruction of isometrically deformable flat surfaces in 3D from multiple camera images
This paper deals with the reconstruction of smooth, flexible, isometrically embedded flat surfaces in 3D, such as a sheet of paper or a flag waving in the wind, from a set of 2...
Ricardo Ferreira, João Xavier, João ...
ICDAR
2009
IEEE
16 years 1 months ago
Text Detection and Localization in Complex Scene Images using Constrained AdaBoost Algorithm
We have proposed a complete system for text detection and localization in gray scale scene images. A boosting framework integrating feature and weak classifier selection based on...
Shehzad Muhammad Hanif, Lionel Prevost