Sciweavers

4679 search results - page 480 / 936
» Modeling When Connections Are the Problem
Sort
View
CIAC
2006
Springer
278views Algorithms» more  CIAC 2006»
15 years 10 months ago
Covering a Set of Points with a Minimum Number of Lines
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
Magdalene Grantson, Christos Levcopoulos
ISW
2000
Springer
15 years 10 months ago
A Signcryption Scheme Based on Integer Factorization
Abstract. Signcryption is a public-key cryptographic primitive introduced by Zheng, which achieves both message confidentiality and nonrepudiatable origin authenticity, at a lower ...
Ron Steinfeld, Yuliang Zheng
CIARP
2008
Springer
15 years 8 months ago
Cluster Stability Assessment Based on Theoretic Information Measures
Abstract. Cluster validation to determine the right number of clusters is an important issue in clustering processes. In this work, a strategy to address the problem of cluster val...
Damaris Pascual, Filiberto Pla, José Salvad...
MVA
2007
160views Computer Vision» more  MVA 2007»
15 years 8 months ago
Probabilistic Motion Segmentation of Videos for Temporal Super Resolution
A novel scheme is proposed for achieving motion segmentation in low-frame rate videos, with application to temporal super resolution. Probabilistic generative models are commonly ...
Arasanathan Thayananthan, Masahiro Iwasaki, Robert...
NIPS
2007
15 years 8 months ago
The Generalized FITC Approximation
We present an efficient generalization of the sparse pseudo-input Gaussian process (SPGP) model developed by Snelson and Ghahramani [1], applying it to binary classification pro...
Andrew Naish-Guzman, Sean B. Holden