Sciweavers

3946 search results - page 276 / 790
» The computational complexity of choice sets
Sort
View
ASIACRYPT
2009
Springer
16 years 1 months ago
Security Bounds for the Design of Code-Based Cryptosystems
Code-based cryptography is often viewed as an interesting “Post-Quantum” alternative to the classical number theory cryptography. Unlike many other such alternatives, it has th...
Matthieu Finiasz, Nicolas Sendrier
FQAS
2009
Springer
202views Database» more  FQAS 2009»
16 years 1 months ago
Controlled Aggregate Tree Shaped Questions over Ontologies
Abstract. Controlled languages (CLs) are ambiguity-free subsets of natural languages such as English offering a good trade-off between the formal rigor of ontology and query langua...
Camilo Thorne, Diego Calvanese
GD
2005
Springer
16 years 8 days ago
MultiPlane: A New Framework for Drawing Graphs in Three Dimensions
This paper presents a new framework for drawing graphs in three dimensions. In general, the new framework uses a divide and conquer approach. More specifically, the framework divi...
Seok-Hee Hong
IFIPTCS
2000
15 years 10 months ago
Hierarchical State Machines
Hierarchical state machines are finite state machines whose states themselves can be other machines. In spite of their popularity in many modeling tools for software design, very l...
Mihalis Yannakakis
BMVC
1998
15 years 8 months ago
Recovering Motion Fields: An Evaluation of Eight Optical Flow Algorithms
Evaluating the performance of optical flow algorithms has been difficult because of the lack of ground-truth data sets for complex scenes. We describe a simple modification to a r...
Ben Galvin, Brendan McCane, Kevin Novins, David Ma...