Sciweavers

5634 search results - page 228 / 1127
» About Abstract Classes
Sort
View
CCCG
2008
15 years 1 months ago
Memory Requirements for Local Geometric Routing and Traversal in Digraphs
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
Maia Fraser, Evangelos Kranakis, Jorge Urrutia
86
Voted
USS
2004
15 years 1 months ago
Graphical Dictionaries and the Memorable Space of Graphical Passwords
In commonplace textual password schemes, users choose passwords that are easy to recall. Since memorable passwords typically exhibit patterns, they are exploitable by brute-force ...
Julie Thorpe, Paul C. van Oorschot
DOA
2000
87views more  DOA 2000»
15 years 1 months ago
MODE: A Java-like Environment for Experimenting Mobility Policies
The wide acceptance of object-oriented environments and proposals has renewed interest in all the class inheritance related issues; in particular its implementation in distributed...
Giuliano Armano, Antonio Corradi, Letizia Leonardi...
ICPR
2010
IEEE
14 years 12 months ago
The Binormal Assumption on Precision-Recall Curves
—The precision-recall curve (PRC) has become a widespread conceptual basis for assessing classification performance. The curve relates the positive predictive value of a classi...
Kay Henning Brodersen, Cheng Soon Ong, Klaas Enno ...
CORR
2010
Springer
149views Education» more  CORR 2010»
14 years 11 months ago
Lower Bounds for the Complexity of Monadic Second-Order Logic
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
Stephan Kreutzer, Siamak Tazari