Sciweavers

154 search results - page 3 / 31
» ets 2011
Sort
View
102
Voted
IACR
2011
121views more  IACR 2011»
14 years 23 days ago
Two RFID Privacy Models in Front of a Court
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...
Mohammad Hassan Habibi, Mohammad Reza Aref
121
Voted
EJIS
2011
118views more  EJIS 2011»
14 years 8 months ago
A response to the design-oriented information systems research memorandum
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 ...
Richard Baskerville, Kalle Lyytinen, Vallabh Samba...
112
Voted
COMGEO
2011
ACM
14 years 8 months ago
Stabbers of line segments in the plane
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...
Mercè Claverol, Delia Garijo, Clara I. Grim...
130
Voted
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 8 months ago
Upper Bounds for Maximally Greedy Binary Search Trees
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...
Kyle Fox
103
Voted
SIAMDM
2011
14 years 8 months ago
On Maximal S-Free Convex Sets
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...
Diego A. Morán R., Santanu S. Dey