Sciweavers

16504 search results - page 3174 / 3301
» New Problems, New Solutions
Sort
View
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
15 years 12 months ago
A Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...
DIAGRAMS
2004
Springer
15 years 12 months ago
Geographic Projection of Cluster Composites
A composite cluster map displays a fuzzy categorisation of geographic areas. It combines information from several sources to provide a visualisation of the significance of cluster...
Peter Kleiweg, John Nerbonne, Leonie Bosveld
ESORICS
2004
Springer
15 years 12 months ago
Discovering Novel Attack Strategies from INFOSEC Alerts
Abstract. Correlating security alerts and discovering attack strategies are important and challenging tasks for security analysts. Recently, there have been several proposed techni...
Xinzhou Qin, Wenke Lee
EUROCRYPT
2004
Springer
15 years 12 months ago
On Generating the Initial Key in the Bounded-Storage Model
Abstract. In the bounded-storage model (BSM) for information-theoretically secure encryption and key-agreement one uses a random string R whose length t is greater than the assumed...
Stefan Dziembowski, Ueli M. Maurer
EUROCRYPT
2004
Springer
15 years 12 months ago
Positive Results and Techniques for Obfuscation
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
Ben Lynn, Manoj Prabhakaran, Amit Sahai
« Prev « First page 3174 / 3301 Last » Next »