Sciweavers

3455 search results - page 99 / 691
» Generalized Game Trees
Sort
View
MIR
2010
ACM
179views Multimedia» more  MIR 2010»
15 years 2 months ago
Speculation on the generality of the backward stepwise view of PCA
A novel backwards viewpoint of Principal Component Analysis is proposed. In a wide variety of cases, that fall into the area of Object Oriented Data Analysis, this viewpoint is se...
J. S. Marron, Sungkyu Jung, Ian L. Dryden
ATAL
2008
Springer
15 years 6 months ago
Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adv...
Praveen Paruchuri, Jonathan P. Pearce, Janusz Mare...
WWW
2010
ACM
15 years 2 months ago
Evaluation Techniques for Generalized Path Pattern Queries on XML Data
Finding the occurrences of structural patterns in XML data is a key operation in XML query processing. Existing algorithms for this operation focus almost exclusively on path patt...
Xiaoying Wu, Dimitri Theodoratos, Stefanos Souldat...
ESSLLI
1999
Springer
15 years 8 months ago
Towards Discontinuous Grammar
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
Matthias T. Kromann
SIGCSE
2005
ACM
217views Education» more  SIGCSE 2005»
15 years 10 months ago
Alternatives to two classic data structures
Red-black trees and leftist heaps are classic data structures that are commonly taught in Data Structures (CS2) and/or Algorithms (CS7) courses. This paper describes alternatives ...
Chris Okasaki