Sciweavers

194 search results - page 12 / 39
» Connectivity in frame matroids
Sort
View
FOCS
2004
IEEE
13 years 11 months ago
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
Lap Chi Lau
TCC
2005
Springer
141views Cryptology» more  TCC 2005»
14 years 23 days ago
Characterizing Ideal Weighted Threshold Secret Sharing
Weighted threshold secret sharing was introduced by Shamir in his seminal work on secret sharing. In such settings, there is a set of users where each user is assigned a positive w...
Amos Beimel, Tamir Tassa, Enav Weinreb
ACS
2007
13 years 7 months ago
Patch-generated Frames and Projectable Hulls
This article considers coherent frame homomorphisms h : L −→ M between coherent frames, which induce an isomorphism between the boolen frames of polars, with M projectable, and...
Anthony W. Hager, Jorge Martínez
DIGRA
2005
Springer
14 years 25 days ago
Framing Virtual Law
Building on the work of games theorists and virtual world designers, this paper proposes a framework for understanding the real-virtual dichotomy in terms of a series of five fram...
Peter Edelmann
IEEEIAS
2008
IEEE
14 years 1 months ago
COTraSE: Connection Oriented Traceback in Switched Ethernet
Layer 2 traceback is an important component of end-toend packet traceback. Whilst IP traceback identifies the origin network, L2 traceback extends the process to provide a more ...
Marios S. Andreou, Aad P. A. van Moorsel