Sciweavers

3378 search results - page 105 / 676
» A universe of binding and computation
Sort
View
ICALP
2009
Springer
15 years 10 months ago
Universal Succinct Representations of Trees?
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
Arash Farzan, Rajeev Raman, S. Srinivasa Rao
EUROCRYPT
2010
Springer
15 years 2 months ago
Universal One-Way Hash Functions via Inaccessible Entropy
This paper revisits the construction of Universal One-Way Hash Functions (UOWHFs) from any one-way function due to Rompel (STOC 1990). We give a simpler construction of UOWHFs, whi...
Iftach Haitner, Thomas Holenstein, Omer Reingold, ...
COR
2010
123views more  COR 2010»
14 years 10 months ago
Decomposition, reformulation, and diving in university course timetabling
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, ...
ECCC
2008
186views more  ECCC 2008»
14 years 10 months ago
Universal Semantic Communication II: A Theory of Goal-Oriented Communication
We continue the investigation of the task of meaningful communication among intelligent entities (players, agents) without any prior common language. Our generic thesis is that su...
Brendan Juba, Madhu Sudan
CLEF
2009
Springer
14 years 7 months ago
The University of Amsterdam's Concept Detection System at ImageCLEF 2009
Our group within the University of Amsterdam participated in the large-scale visual concept detection task of ImageCLEF 2009. Our experiments focus on increasing the robustness of...
Koen E. A. van de Sande, Theo Gevers, Arnold W. M....