Sciweavers

566 search results - page 93 / 114
» Array Abstractions from Proofs
Sort
View
CORR
2006
Springer
120views Education» more  CORR 2006»
13 years 7 months ago
Improved Bounds and Schemes for the Declustering Problem
Abstract. The declustering problem is to allocate given data on parallel working storage devices in such a manner that typical requests find their data evenly distributed among the...
Benjamin Doerr, Nils Hebbinghaus, Sören Werth
JOC
2006
116views more  JOC 2006»
13 years 7 months ago
On the Fly Authentication and Signature Schemes Based on Groups of Unknown Order
Abstract. In response to the current need for fast, secure and cheap public-key cryptography, we propose an interactive zero-knowledge identification scheme and a derived signature...
Marc Girault, Guillaume Poupard, Jacques Stern
AAECC
2005
Springer
128views Algorithms» more  AAECC 2005»
13 years 7 months ago
The size-change principle and dependency pairs for termination of term rewriting
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
René Thiemann, Jürgen Giesl
ECCV
2004
Springer
14 years 9 months ago
Weighted Minimal Hypersurfaces and Their Applications in Computer Vision
Abstract. Many interesting problems in computer vision can be formulated as a minimization problem for an energy functional. If this functional is given as an integral of a scalar-...
Bastian Goldlücke, Marcus A. Magnor
VIS
2005
IEEE
122views Visualization» more  VIS 2005»
14 years 8 months ago
Effectively Visualizing Large Networks Through Sampling
We study the problem of visualizing large networks and develop es for effectively abstracting a network and reducing the size to a level that can be clearly viewed. Our size reduc...
Davood Rafiei, Stephen Curial