Sciweavers

1101 search results - page 179 / 221
» Forcing in proof theory
Sort
View
FOCS
2006
IEEE
14 years 5 months ago
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
Tamás Király, Lap Chi Lau
ICNP
2006
IEEE
14 years 5 months ago
Rigorous Protocol Design in Practice: An Optical Packet-Switch MAC in HOL
— This paper reports on an experiment in network protocol design: we use novel rigorous techniques in the design process of a new protocol, in a close collaboration between syste...
Adam Biltcliffe, Michael Dales, Sam Jansen, Tom Ri...
COMPGEOM
2006
ACM
14 years 5 months ago
Vines and vineyards by updating persistence in linear time
Persistent homology is the mathematical core of recent work on shape, including reconstruction, recognition, and matching. Its pertinent information is encapsulated by a pairing o...
David Cohen-Steiner, Herbert Edelsbrunner, Dmitriy...
PLDI
2006
ACM
14 years 5 months ago
Specifying distributed trust management in LolliMon
We propose the monadic linear logic programming language LolliMon as a new foundation for the specification of distributed trust management systems, particularly the RT framework...
Jeff Polakow, Christian Skalka
SCESM
2006
ACM
269views Algorithms» more  SCESM 2006»
14 years 5 months ago
Inferring operational requirements from scenarios and goal models using inductive learning
Goal orientation is an increasingly recognised Requirements Engineering paradigm. However, integration of goal modelling with operational models remains an open area for which the...
Dalal Alrajeh, Alessandra Russo, Sebastián ...