Sciweavers

945 search results - page 97 / 189
» Graph Types
Sort
View
RFIDSEC
2010
15 years 23 days ago
The Poulidor Distance-Bounding Protocol
RFID authentication protocols are susceptible to different types of relay attacks such as mafia and distance frauds. A countermeasure against these types of attacks are the well-...
Rolando Trujillo-Rasua, Benjamin Martin 0002, Gild...
ACS
2010
15 years 2 months ago
Fibrations of Simplicial Sets
There are infinitely many variants of the notion of Kan fibration that, together with suitable choices of cofibrations and the usual notion of weak equivalence of simplicial sets, ...
Tibor Beke
CORR
2010
Springer
106views Education» more  CORR 2010»
15 years 2 months ago
Symmetry within Solutions
We define the concept of an internal symmetry. This is a symmety within a solution of a constraint satisfaction problem. We compare this to solution symmetry, which is a mapping b...
Marijn Heule, Toby Walsh
APPML
2002
58views more  APPML 2002»
15 years 2 months ago
Layered clusters of tightness set functions
A method for structural clustering is proposed involving data on subset-to-entity linkages that can be calculated with structural data such as graphs or sequences or images. The m...
Boris Mirkin, Ilya B. Muchnik
JMLR
2010
158views more  JMLR 2010»
14 years 9 months ago
Topology Selection in Graphical Models of Autoregressive Processes
An algorithm is presented for topology selection in graphical models of autoregressive Gaussian time series. The graph topology of the model represents the sparsity pattern of the...
Jitkomut Songsiri, Lieven Vandenberghe