Sciweavers

378 search results - page 61 / 76
» How Many Ways Can One Draw a Graph
Sort
View
154
Voted
CRYPTO
2010
Springer
181views Cryptology» more  CRYPTO 2010»
15 years 4 months ago
On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
Severin Winkler, Jürg Wullschleger
COSIT
2001
Springer
142views GIS» more  COSIT 2001»
15 years 8 months ago
The Utility of Global Representations in a Cognitive Map
In this paper we propose the use of small global memory for a viewer’s immediate surroundings to assist in recognising places that have been visited previously. We call this glob...
Margaret E. Jefferies, Wai K. Yeap
110
Voted
CONCUR
2010
Springer
15 years 4 months ago
Obliging Games
Abstract. Graph games of infinite length provide a natural model for open reactive systems: one player (Eve) represents the controller and the other player (Adam) represents the en...
Krishnendu Chatterjee, Florian Horn, Christof L&ou...
IJCV
1998
238views more  IJCV 1998»
15 years 3 months ago
Feature Detection with Automatic Scale Selection
The fact that objects in the world appear in different ways depending on the scale of observation has important implications if one aims at describing them. It shows that the not...
Tony Lindeberg
190
Voted
ECOOP
2003
Springer
15 years 8 months ago
LeakBot: An Automated and Lightweight Tool for Diagnosing Memory Leaks in Large Java Applications
Despite Java’s automatic reclamation of memory, memory leaks remain an important problem. For example, we frequently encounter memory leaks that cause production servers to crash...
Nick Mitchell, Gary Sevitsky