Sciweavers

1066 search results - page 44 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
DSOM
2004
Springer
15 years 3 months ago
A Formal Validation Model for the Netconf Protocol
Netconf is a protocol proposed by the IETF that defines a set of operations for network configuration. One of the main issues of Netconf is to define operations such as validate...
Sylvain Hallé, Rudy Deca, Omar Cherkaoui, R...
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
14 years 8 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...
CVPR
2010
IEEE
15 years 3 months ago
Face Recognition Based on Image Sets
We introduce a novel method for face recognition from image sets. In our setting each test and training example is a set of images of an individual’s face, not just a single ima...
Hakan Cevikalp, Bill Triggs
SDM
2009
SIAM
193views Data Mining» more  SDM 2009»
15 years 7 months ago
Agglomerative Mean-Shift Clustering via Query Set Compression.
Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets...
Xiaotong Yuan, Bao-Gang Hu, Ran He
DCC
2008
IEEE
15 years 9 months ago
Edge local complementation and equivalence of binary linear codes
Abstract. Orbits of graphs under the operation edge local complementation (ELC) are defined. We show that the ELC orbit of a bipartite graph corresponds to the equivalence class of...
Lars Eirik Danielsen, Matthew G. Parker