Sciweavers

4451 search results - page 275 / 891
» On Random Ordering Constraints
Sort
View
COMBINATORICS
2002
113views more  COMBINATORICS 2002»
15 years 6 months ago
Longest Increasing Subsequences in Pattern-Restricted Permutations
Inspired by the results of Baik, Deift and Johansson on the limiting distribution of the lengths of the longest increasing subsequences in random permutations, we find those limit...
Emeric Deutsch, A. J. Hildebrand, Herbert S. Wilf
TDHMS
2008
15 years 5 months ago
Oracle Channels
In this paper, well-known attacks named oracle attacks are formulated within a realistic network communication model where they reveal to use suitable covert channels, we name orac...
Ilaria Venturini
CMS
2006
150views Communications» more  CMS 2006»
15 years 8 months ago
Attribute Delegation Based on Ontologies and Context Information
This paper presents a model for delegation based on partial orders, proposing the subclass relation in OWL as a way to represent the partial orders. Delegation and authorization de...
Isaac Agudo, Javier Lopez, José A. Monteneg...
CVPR
2010
IEEE
16 years 3 months ago
Segmentation of Building Facades Using Procedural Shape Priors
In this paper we propose a novel approach to the perceptual interpretation of building facades that combines shape grammars, supervised classification and random walks. Procedural...
Olivier Teboul, Loic Simon, Panagiotis Koutsouraki...
RT
1998
Springer
15 years 11 months ago
Global Ray-Bundle Tracing with Hardware Acceleration
The paper presents a single-pass, view-dependent method to solve the general rendering equation, using a combined finite element and random walk approach. Applying finite element t...
László Szirmay-Kalos, Werner Purgath...