Sciweavers

4781 search results - page 396 / 957
» Complexity at large
Sort
View
GD
1995
Springer
15 years 8 months ago
Fast Interactive 3-D Graph Visualization
We present a 3-D version of GEM [6], a randomized adaptive layout algorithm for nicely drawing undirected graphs, based on the spring-embedder paradigm [4]. The new version, GEM-3D...
Ingo Bruß, Arne Frick
170
Voted
DLOG
2007
15 years 7 months ago
Blocking Automata for PSPACE DLs
In Description Logics (DLs), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problems such as c...
Franz Baader, Jan Hladik, Rafael Peñaloza
CCS
2008
ACM
15 years 7 months ago
Robust, anonymous RFID authentication with constant key-lookup
A considerable number of anonymous RFID authentication schemes have been proposed. However, current proposals either do not provide robust security guarantees, or suffer from scal...
Mike Burmester, Breno de Medeiros, Rossana Motta
CDES
2008
123views Hardware» more  CDES 2008»
15 years 6 months ago
R-tree: A Hardware Implementation
R-tree data structures are widely used in spatial databases to store, manage and manipulate spatial information. As the data volume of such databases is typically very large, the q...
Xiang Xiao, Tuo Shi, Pranav Vaidya, Jaehwan John L...
SE
2010
15 years 6 months ago
Automated Benchmarking of Java APIs
: Performance is an extra-functional property of software systems which is often critical for achieving sufficient scalability or efficient resource utilisation. As many applicatio...
Michael Kuperberg, Fouad Omri, Ralf Reussner