Sciweavers

1399 search results - page 161 / 280
» Multi-party Finite Computations
Sort
View
IEEESCC
2005
IEEE
15 years 10 months ago
Web Services Composition: A Story of Models, Automata, and Logics
eal world”, represented abstractly using (time-varying) first-order logic predicates and terms. A representative composition result [11] here uses a translation into Petri nets. ...
Richard Hull
HYBRID
2000
Springer
15 years 8 months ago
Optimization-Based Verification and Stability Characterization of Piecewise Affine and Hybrid Systems
In this paper, we formulate the problem of characterizing the stability of a piecewise affine (PWA) system as a verification problem. The basic idea is to take the whole Rn as the ...
Alberto Bemporad, Fabio Danilo Torrisi, Manfred Mo...
BCS
2008
15 years 5 months ago
Fast Estimation of Nonparametric Kernel Density Through PDDP, and its Application in Texture Synthesis
In this work, a new algorithm is proposed for fast estimation of nonparametric multivariate kernel density, based on principal direction divisive partitioning (PDDP) of the data s...
Arnab Sinha, Sumana Gupta
EOR
2010
88views more  EOR 2010»
15 years 4 months ago
Mathematical programming approaches for generating p-efficient points
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
Miguel A. Lejeune, Nilay Noyan
TCS
2008
15 years 4 months ago
Kernel methods for learning languages
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri