Sciweavers

1058 search results - page 140 / 212
» It's Doomed; We Can Prove It
Sort
View
ESA
2007
Springer
118views Algorithms» more  ESA 2007»
14 years 4 months ago
A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this pro...
Markus Chimani, Maria Kandyba, Petra Mutzel
SOFSEM
2007
Springer
14 years 4 months ago
A Simple Algorithm for Stable Minimum Storage Merging
We contribute to the research on stable minimum storage merging by introducing an algorithm that is particularly simply structured compared to its competitors. The presented algori...
Pok-Son Kim, Arne Kutzner
ICDAR
2005
IEEE
14 years 3 months ago
A Novel Approach to Recover Writing Order From Single Stroke Offline Handwritten Images
Problem of recovering a writing order from singlestroked handwritten image can be seen as finding the smoothest Euler path in its graph representation. In this paper, a novel appr...
Yu Qiao, Makoto Yasuhara
STORAGESS
2005
ACM
14 years 3 months ago
Security of erasable memories against adaptive adversaries
We study cryptographic modeling and encryption-based design techniques for guaranteeing privacy of data that is first stored in some type of computer memory and then deleted. We ...
Giovanni Di Crescenzo
ACNS
2005
Springer
134views Cryptology» more  ACNS 2005»
14 years 3 months ago
Dynamic k-Times Anonymous Authentication
k-times anonymous authentication (k-TAA) schemes allow members of a group to be anonymously authenticated by application providers for a bounded number of times. k-TAA has applicat...
Lan Nguyen, Reihaneh Safavi-Naini