Sciweavers

1199 search results - page 227 / 240
» Parameterized Proof Complexity
Sort
View
SSD
2009
Springer
149views Database» more  SSD 2009»
16 years 12 days ago
Analyzing Trajectories Using Uncertainty and Background Information
A key issue in clustering data, regardless the algorithm used, is the definition of a distance function. In the case of trajectory data, different distance functions have been pro...
Bart Kuijpers, Bart Moelans, Walied Othman, Alejan...
COMPGEOM
2009
ACM
16 years 12 days ago
Proximity of persistence modules and their diagrams
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...
Frédéric Chazal, David Cohen-Steiner...
COMPGEOM
2009
ACM
16 years 12 days ago
Coresets for polytope distance
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
Bernd Gärtner, Martin Jaggi
SIGCOMM
2009
ACM
16 years 11 days ago
Temporal distance metrics for social network analysis
The analysis of social and technological networks has attracted a lot of attention as social networking applications and mobile sensing devices have given us a wealth of real data...
John Tang, Mirco Musolesi, Cecilia Mascolo, Vito L...
ACNS
2008
Springer
143views Cryptology» more  ACNS 2008»
16 years 7 days ago
On the Security of the CCM Encryption Mode and of a Slight Variant
In this paper, we present an analysis of the CCM mode of operations and of a slight variant. CCM is a simple and efficient encryption scheme which combines a CBC-MAC authentication...
Pierre-Alain Fouque, Gwenaëlle Martinet, Fr&e...