Sciweavers

130 search results - page 10 / 26
» Decidability Problems of a Basic Class of Object Nets
Sort
View
LPAR
2010
Springer
13 years 6 months ago
The Complexity of Partial-Observation Parity Games
We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both p...
Krishnendu Chatterjee, Laurent Doyen
RP
2010
Springer
150views Control Systems» more  RP 2010»
13 years 5 months ago
Rewriting Systems for Reachability in Vector Addition Systems with Pairs
We adapt hypergraph rewriting system to a generalization of Vector Addition Systems with States (VASS) that we call vector addition systems with pairs (VASP). We give rewriting sys...
Paulin Jacobé de Naurois, Virgile Mogbil
AIPS
2006
13 years 9 months ago
Tractable Optimal Competitive Scheduling
In this paper we describe the problem of Optimal Competitive Scheduling, which consists of activities that compete for a shared resource. The objective is to choose a subset of ac...
Jeremy Frank, James Crawford, Lina Khatib, Ronen I...
CVPR
2008
IEEE
14 years 9 months ago
Unsupervised learning of probabilistic object models (POMs) for object classification, segmentation and recognition
We present a new unsupervised method to learn unified probabilistic object models (POMs) which can be applied to classification, segmentation, and recognition. We formulate this a...
Yuanhao Chen, Long Zhu, Alan L. Yuille, HongJiang ...
NIPS
2008
13 years 9 months ago
Structured ranking learning using cumulative distribution networks
Ranking is at the heart of many information retrieval applications. Unlike standard regression or classification in which we predict outputs independently, in ranking we are inter...
Jim C. Huang, Brendan J. Frey