154 search results - page 3 / 31 » ets 2011 |
IACR
2011
12 years 9 months ago
2011
In ASIACRYPT 2007, Vaudenay proposed a comprehensive privacy model for unilateral RFID schemes. Soon after, in ASIACCS 2008, Paise and Vaudenay presented a new version of the cited...
EJIS
2011
13 years 4 months ago
2011
In response to O¨ sterle et al.’s ‘Memorandum on Design Oriented Information Systems Research’, this commentary disputes, and expands the context of, several premises used ...
COMGEO
2011
ACM
13 years 4 months ago
2011
ACM
The problem of computing a representation of the stabbing lines of a set S of segments in the plane was solved by Edelsbrunner et al. We provide efficient algorithms for the follo...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Der...
SIAMDM
2011
13 years 4 months ago
2011
Let S ⊆ Zn satisfy the property that conv(S) ∩ Zn = S. Then a convex set K is called an S-free convex set if int(K) ∩ S = ∅. A maximal S-free convex set is an S-free convex...