Sciweavers

535 search results - page 34 / 107
» Generalized Version Space Trees
Sort
View
IJNSEC
2007
131views more  IJNSEC 2007»
14 years 11 months ago
An Asymmetric Cryptographic Key Assignment Scheme for Access Control in Tree Structural Hierarchies
In a hierarchical structure, a user in a security class has access to information items of another class if and only if the former class is a predecessor of latter. Based upon cry...
Debasis Giri, Parmeshwary Dayal Srivastava
IPL
2010
71views more  IPL 2010»
14 years 10 months ago
New common ancestor problems in trees and directed acyclic graphs
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
Johannes Fischer, Daniel H. Huson
ACL
2010
14 years 9 months ago
Bayesian Synchronous Tree-Substitution Grammar Induction and Its Application to Sentence Compression
We describe our experiments with training algorithms for tree-to-tree synchronous tree-substitution grammar (STSG) for monolingual translation tasks such as sentence compression a...
Elif Yamangil, Stuart M. Shieber
CEC
2008
IEEE
15 years 6 months ago
Geometric PSO + GP = Particle Swarm Programming
—Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both conti...
Julian Togelius, Renzo De Nardi, Alberto Moraglio
SODA
2000
ACM
120views Algorithms» more  SODA 2000»
15 years 1 months ago
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
S. Thomas McCormick, Akiyoshi Shioura