Sciweavers

5255 search results - page 774 / 1051
» Formal Methods for Privacy
Sort
View
IPPS
2008
IEEE
16 years 1 months ago
What is the best way to prove a cryptographic protocol correct?
In this paper, we identify that protocol verification using invariants have significant limitations such as inapplicability to some protocols, non-standard attacker inferences a...
Sreekanth Malladi, Gurdeep S. Hura
IV
2008
IEEE
155views Visualization» more  IV 2008»
16 years 1 months ago
Visualise Undrawable Euler Diagrams
Given a group of overlapping sets, it is not always possible to represent it with Euler diagrams. Euler diagram characteristics might collide with the sets relationships to depict...
Paolo Simonetto, David Auber
LICS
2008
IEEE
16 years 1 months ago
Structural Logical Relations
Tait’s method (a.k.a. proof by logical relations) is a powerful proof technique frequently used for showing foundational properties of languages based on typed λ-calculi. Histo...
Carsten Schürmann, Jeffrey Sarnat
CEC
2007
IEEE
16 years 29 days ago
An investigation of hyper-heuristic search spaces
— Hyper-heuristics or “heuristics that coordinate heuristics” are fastly becoming popular for solving combinatorial optimisation problems. These methods do not search directl...
José Antonio Vázquez Rodrígue...
DASFAA
2007
IEEE
153views Database» more  DASFAA 2007»
16 years 29 days ago
Interval-Focused Similarity Search in Time Series Databases
Similarity search in time series databases usually deals with comparing entire time series objects or subsequence search. In this paper, we formalize the notion of interval-focused...
Johannes Aßfalg, Hans-Peter Kriegel, Peer Kr...